A Characterization of the Degree Sequences of 2-Trees
Discrete Mathematics
2012-10-23 v2 Combinatorics
Abstract
A graph G is a 2-tree if G=K_3, or G has a vertex v of degree 2, whose neighbours are adjacent, and G\v{i}s a 2-tree. A characterization of the degree sequences of 2-trees is given. This characterization yields a linear-time algorithm for recognizing and realizing degree sequences of 2-trees.
Cite
@article{arxiv.cs/0605011,
title = {A Characterization of the Degree Sequences of 2-Trees},
author = {Prosenjit Bose and Vida Dujmović and Danny Krizanc and Stefan Langerman and Pat Morin and David R. Wood and Stefanie Wuhrer},
journal= {arXiv preprint arXiv:cs/0605011},
year = {2012}
}
Comments
17 pages, 5 figures