A characterization of the degree sequences of 2-trees

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

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

Abstract

A graph G is a 2-tree if G = K3 or G has a vertex v of degree 2, whose neighbours are adjacent, and G\v is 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.
Original languageEnglish
Title of host publicationProceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics
PublisherSociety for Industrial & Applied Mathematics (SIAM)
Pages232-241
Number of pages10
Publication statusPublished - 2007
Externally publishedYes

Cite this