A Characterization of the degree sequences of 2-trees

DOI10.1002/jgt.20302zbMath1167.05308arXivcs/0605011OpenAlexW2951892290MaRDI QIDQ3522846

Vida Dujmović, Prosenjit Bose, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer, Danny Krizanc

Publication date: 4 September 2008

Published in: Journal of Graph Theory, 2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0605011

zbMATH Keywords

treewidth\(k\)-treedegree sequenceseries-parallel graph2-treegraphical degree sequence

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items

On degree sequences and eccentricities in pseudoline arrangement graphs, On a characterization of k-trees, Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices, Reconstructing Cactus Graphs from Shortest Path Information, Degree Sequence of Tight Distance Graphs, The feasibility problem for line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence of graphs with a given set of r-neighborhoods
• An unresolved conjecture on nonmaximal planar graphical sequences
• Degree sets of k-trees: Small k
• The splittance of a graph
• A partial k-arboretum of graphs with bounded treewidth
• Solution to a problem on degree sequences of graphs
• Split graphs
• Sequences Characterizing k-Trees
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On Planar Graphical Degree Sequences