Notes on Factor-Criticality, Extendibility and Independence Number

Zhang, Zan-Bo; Lou, Dingjun; Zhang, Xiaoyan

Abstract

References

Ars Combinatoria

Volume 087
Pages: 139-146

Research article

Notes on Factor-Criticality, Extendibility and Independence Number

^¹,², ^², ^³

¹Department of Computer Engineering, Guangdong Industry Technical College, Guangzhou 510300, China

²Department of Computer Science, Sun Yat-sen University, Guangzhou 510275, China

³School of Mathematics and Computer Science & Institute of Mathematics, Nanjing Normal University, Nanjing 210097, China

Published: 30/04/2008

Download PDF
Cite

Copyright Link
License

Abstract

In this paper, we give a sufficient and necessary condition for a $k$ -extendable graph to be $2 k$ -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.

Contents

Ars Combinatoria

Notes on Factor-Criticality, Extendibility and Independence Number

Abstract

Information

Guidelines

CP Initiatives

Follow CP