Autor:	Zhang, Zan-Bo, Wang, Tao, Lou, Dingjun
Rok vydání:	2010
Předmět:	Mathematics - Combinatorics 05C70
Zdroj:	Ars Combinatoria, 85(2007), 279-285
Druh dokumentu:	Working Paper
Popis:	In this paper, we show that if $k\geq (\nu+2)/4$, where $\nu$ denotes the order of a graph, a non-bipartite graph $G$ is $k$-extendable if and only if it is $2k$-factor-critical. If $k\geq (\nu-3)/4$, a graph $G$ is $k\ 1/2$-extendable if and only if it is $(2k+1)$-factor-critical. We also give examples to show that the two bounds are best possible. Our results are answers to a problem posted by Favaron [3] and Yu [11]. Comment: This paper has been published at Ars Combinatoria
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1011.3381 Zobrazit plný text záznamu View this record from Arxiv