REMOVABLE EARS OF 1-EXTENDABLE GRAPHS

CORC > 厦门大学 > 数学科学－已发表论文

	REMOVABLE EARS OF 1-EXTENDABLE GRAPHS
	Zhai, S. H. ; Guo, X. F. ; Guo XF(郭晓峰)
刊名	http://dx.doi.org/10.1007/s11424-010-7122-0
	2010-04
关键词	DECOMPOSITIONS
英文摘要	National Science Foundation of China [10831001]; Fujian Provincial Department of Education [JA08223]; Carvalho, Lucchesi and Murty proved that any 1-extendable graph G different from K(2) and C(2n) has at least Delta(G) edge-disjoint removable ears, and any brick G distinct from K(4) and (C(6)) over bar has at least Delta(G) - 2 removable edges, where Delta(G) denotes the maximum degree of G. In this paper, we improve the lower bounds for numbers of removable ears and removable edges of 1-extendable graphs. It is proved that any 1-extendable graph G different from K(2) and C(2n) has at least chi'(G) edge-disjoint removable ears, and any brick G distinct from K(4) and (C(6)) over bar has at least chi'(G)-2 removable edges, where chi'(G) denotes the edge-chromatic number of G.
语种	英语
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/66777]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	Zhai, S. H.,Guo, X. F.,Guo XF. REMOVABLE EARS OF 1-EXTENDABLE GRAPHS[J]. http://dx.doi.org/10.1007/s11424-010-7122-0,2010.
APA	Zhai, S. H.,Guo, X. F.,&郭晓峰.(2010).REMOVABLE EARS OF 1-EXTENDABLE GRAPHS.http://dx.doi.org/10.1007/s11424-010-7122-0.
MLA	Zhai, S. H.,et al."REMOVABLE EARS OF 1-EXTENDABLE GRAPHS".http://dx.doi.org/10.1007/s11424-010-7122-0 (2010).