Contents

Ars Combinatoria

  • Research article

Notes on Factor-Criticality, Extendibility and Independence Number

Zan-Bo Zhang1,2, Dingjun Lou2, Xiaoyan Zhang3
1Department of Computer Engineering, Guangdong Industry Technical College, Guangzhou 510300, China
2Department of Computer Science, Sun Yat-sen University, Guangzhou 510275, China
3School of Mathematics and Computer Science & Institute of Mathematics, Nanjing Normal University, Nanjing 210097, China
  • Published: 30/04/2008

Abstract

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

Citation
Zan-Bo Zhang, Dingjun Lou, Xiaoyan Zhang. Notes on Factor-Criticality, Extendibility and Independence Number[J], Ars Combinatoria, Volume 087. 139-146. .