English

Notes on factor-criticality, extendibility and independence number

Combinatorics 2010-11-16 v1

Abstract

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

Keywords

Cite

@article{arxiv.1011.3384,
  title  = {Notes on factor-criticality, extendibility and independence number},
  author = {Zan-Bo Zhang and Dingjun Lou and Xiaoyan Zhang},
  journal= {arXiv preprint arXiv:1011.3384},
  year   = {2010}
}

Comments

This paper has been published on Ars Combinatoria

R2 v1 2026-06-21T16:43:54.041Z