A Characterization of the Degree Sequences of 2-Trees

Details A Characterization of the Degree Sequences of 2-Trees A Characterization of the Degree Sequences of 2-Trees

2006-05-03

arxiv.org/abs/cs/0605011v2

Computer Science

Discrete Mathematics

17 pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Characterization of the Degree Sequences of 2-Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Characterization of the Degree Sequences of 2-Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Characterization of the Degree Sequences of 2-Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307295