A Characterization of the Degree Sequences of 2-Trees
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.
Keywords
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Pages: 232 - 241
Editors: Daniel Panario, Carleton University, Ottawa, Ontario, Canada and Robert Sedgewick, Princeton University, Princeton, New Jersey
ISBN (Online): 978-1-61197-297-9
Copyright
© 2007 by the Society for Industrial and Applied Mathematics.
History
Published online: 18 December 2013
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
There are no citations for this item