# Constructing bounded degree graphs with prescribed degree and neighbor degree sequences

Let D = d_1, d_2, …, d_n and F = f_1, f_2,…, f_n be two sequences of positive integers. We consider the following decision problems: is there a i) multigraph, ii) loopless multigraph, iii) simple graph, iv) connected simple graph, v) tree, vi) caterpillar G = (V,E) such that for all k, d(v_k) = d_k and ∑_w∈𝒩(v_k) d(w) = f_k (d(v) is the degree of v and 𝒩(v) is the set of neighbors of v). Here we show that all these decision problems can be solved in polynomial time if max_k d_k is bounded. The problem is motivated by NMR spectroscopy of hydrocarbons.

## Authors

• 1 publication
• 1 publication
• 5 publications
• 1 publication
• 1 publication
• ### The generalized locally checkable problem in bounded treewidth graphs

We introduce a new problem that generalizes some previous attempts of co...
06/01/2020 ∙ by Flavia Bonomo-Braberman, et al. ∙ 0

• ### Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs

The complexity of graph homomorphisms has been a subject of intense stud...
04/14/2020 ∙ by Jin-Yi Cai, et al. ∙ 0

• ### Solving problems on generalized convex graphs via mim-width

A bipartite graph G=(A,B,E) is H-convex, for some family of graphs H, if...
08/20/2020 ∙ by Nick Brettell, et al. ∙ 0

• ### On Degree Sequence Optimization

We consider the problem of finding a subgraph of a given graph which max...
03/11/2020 ∙ by Shmuel Onn, et al. ∙ 0

• ### Extension of vertex cover and independent set in some classes of graphs and generalizations

We consider extension variants of the classical graph problems Vertex Co...
10/10/2018 ∙ by Katrin Casel, et al. ∙ 0

• ### Connectedness matters: Construction and exact random sampling of connected graphs

We describe a new method for the random sampling of connected networks w...
09/08/2020 ∙ by Szabolcs Horvát, et al. ∙ 0