Paper Info
Title
Stability Number And Minimum Degree For (A, B, K)-Ritical Graphs
Abstract
In this paper, a sufficient condition for graphs to be (a, b, k)-critical graphs is given. This result is best possible in some sense, and it is an improvement of the previous result of Zhou, Xu and Zong.
Year
DOI
Venue
2013
10.1142/S1793830913500274
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
Keywords
Field
DocType
Graph, stability number, minimum degree, [a, b]-factor, (a, b, k)-critical graph
Discrete mathematics,Indifference graph,Combinatorics,Chordal graph,Cograph,Pathwidth,1-planar graph,Mathematics,Metric dimension,Maximal independent set,Split graph
Journal
Volume
Issue
ISSN
5
4
1793-8309
Citations 
PageRank 
References 
0
0.34
8
Authors
3
Name
Order
Citations
PageRank
Sizhong Zhou12512.74
Yang Xu211841.02
Jian-Cheng Wu37013.30