CYCLES IN GRAPHS WITH PRESCRIBED STABILITY NUMBER AND CONNECTIVITY

被引:22
作者
KOUIDER, M
机构
关键词
D O I
10.1006/jctb.1994.1023
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
D. Amar, I. Fournier, A. Germa, R. Haggkvist, and C. Thomassen conjectured that the vertices of a k-connected graph with stability number alpha can be covered by inverted right perpendicular alpha/k inverted left perpendicular cycles. We prove this conjecture. (C) 1994 Academic Press, Inc.
引用
收藏
页码:315 / 318
页数:4
相关论文
共 5 条
[1]  
Amar D., 1984, ANN DISCRETE MATH, P43
[2]  
BONDY JA, 1993, HDB COMBINATORICS
[3]  
Chvatal V., 1972, DISCRETE MATH, V2, P111, DOI [DOI 10.1016/0012-365X(72)90079-9, 10.1016/0012-365X(72)90079-9]
[4]  
FOURNIER I, 1982, THESIS U PARIS SUD O, P3
[5]  
MANOUSSAKIS Y, 1987, THESIS U PARIS SUD O, P6