arXiv Analytics

Sign in

arXiv:1011.3384 [math.CO]AbstractReferencesReviewsResources

Notes on factor-criticality, extendibility and independence number

Zan-Bo Zhang, Dingjun Lou, Xiaoyan Zhang

Published 2010-11-15Version 1

In this paper, we give a sufficient and necessary condition for a $k$-extendable graph to be $2k$-factor-critical when $k=\nu/4$, and prove some results on independence numbers in $n$-factor-critical graphs and $k\frac{1}{2}$-extendable graphs.

Comments: This paper has been published on Ars Combinatoria
Journal: Ars Combinatoria 87 (2008), 139-146
Categories: math.CO
Subjects: 05C70
Related articles: Most relevant | Search more
arXiv:1501.07549 [math.CO] (Published 2015-01-29)
Equimatchable factor-critical graphs and independence number 2
arXiv:1011.3381 [math.CO] (Published 2010-11-15)
Equivalence between Extendibility and Factor-Criticality
arXiv:1907.08626 [math.CO] (Published 2019-07-19)
A new class of polynomials from to the spectrum of a graph, and its application to bound the $k$-independence number