A CHARACTERIZATION OF THE DEGREE SEQUENCES OF 2-TREES

摘要

A graph G is a 2-tree if G = K{sub}3, or G has a vertex v of degree 2, whose neighbours are adjacent, and G 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.