A Characterization of the Degree Sequences of 2-Trees
<|reference_start|>A Characterization of the Degree Sequences of 2-Trees: 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.<|reference_end|>
@article{bose2006a,
    title={A Characterization of the Degree Sequences of 2-Trees},
    author={Prosenjit Bose, Vida Dujmovi'c, Danny Krizanc, Stefan Langerman, Pat
  Morin, David R. Wood, Stefanie Wuhrer},
    journal={The Journal of Graph Theory, 58(3):191-209, 2008},
    year={2006},
    doi={10.1002/jgt.20302},
    archivePrefix={arXiv},
    eprint={cs/0605011},
    primaryClass={cs.DM math.CO}
}