A Characterization of the degree sequences of 2‐trees
A Characterization of the degree sequences of 2‐trees
复制标题
DOI：
10.1002/jgt.20302
复制
发表时间：
2006-05
影响因子：
0.9
通讯作者：
P. Bose;V. Dujmovic;D. Krizanc;S. Langerman;Pat Morin;D. Wood;Stefanie Wuhrer
中科院分区：
文献类型：
--
作者：
P. Bose;V. Dujmovic;D. Krizanc;S. Langerman;Pat Morin;D. Wood;Stefanie Wuhrer
一个图G是一个2-树，如果G = K3，或者G有一个2度的顶点v，其邻居是相邻的，并且G/ v是一个2-树。给出了2-树的度序列的一个刻画。这个特征产生了一个线性时间算法，用于识别和实现2-树的度序列。© 2008 Wiley Periodicals，Inc. J Graph Theory 58：191 - 209，2008
A graph G is a 2‐tree if G = K3, or G has a vertex v of degree 2, whose neighbors 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. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:191‐209, 2008