A Characterization On Potentially K6-C4-graphic Sequences

被引：0

作者：

Hu, Lili ^{[1
]}

Lai, Chunhui ^{[1
]}

机构：

[1] Zhangzhou Teachers Coll, Dept Math, Zhangzhou 363000, Fujian, Peoples R China

来源：

ARS COMBINATORIA | 2014年 / 113卷

关键词：

graph; degree sequence; potentially H-graphic sequences;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For given a graph H, a graphic sequence pi = (d(1), d(2), ... , d(n)) is said to be potentially H-graphic if there exists a realization of pi containing H as a subgraph. Let K-m - H be the graph obtained from K-m by removing the edges set E(H) where H is a subgraph of K-m. In this paper, we characterize the potentially K6 - C4-graphic sequences. This characterization implies a theorem due to Hu and Lai [7].

引用

页码：161 / 174

页数：14

共 22 条

[1]

Bondy J. A., 1976, GRAPH THEORY WITH AP

[2]

Chen G., 2007, J. ZhangZhou Teach. Coll. Nat. Sci, V20, P5

[3]

Chen G., 2006, J. Guangxi Norm. Univ. Nat. Sci, V24, P26

[4]

[陈纲 Chen Gang], 2003, [广西大学学报. 自然科学版, Journal of Guangxi University], V28, P119

[5]

Eschen E., 2004, Australas. J. Combin, V29, P59

[6]

Gould R.J., 1999, Combinatorics, Graph Theory, and Algorithms, V1, P451

[7]

Hu L. H., PREPRINT

[8]

Hu LL, 2011, ARS COMBINATORIA, V101, P359

[9]

Hu LL, 2011, ARS COMBINATORIA, V99, P175

[10]

Hu LL, 2009, UTILITAS MATHEMATICA, V80, P33

← 1 2 3 →