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 Gis 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.