Independence number, connectivity and \((a,b,k)\)-critical graphs

DOI10.1016/j.disc.2008.12.013zbMath1211.05067OpenAlexW2066222913MaRDI QIDQ1043587

Si-zhong Zhou

Publication date: 9 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.013

zbMATH Keywords

graphindependence numberconnectivity\([a, b\)-factor](\(a, b,k)\)-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items

A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs], A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS], Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs, Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors], An existence theorem on fractional deleted graphs, Sufficient condition for the existence of an even \([a,b\)-factor in graph], The existence of \(P_{\geq3}\)-factor covered graphs, A sufficient condition for the existence of a k-factor excluding a given r-factor, Toughness and \((a,b,k)\)-critical graphs, Stability Number and k-Hamiltonian [a, b-factors], A binding number condition for graphs to be \((a, b, k)\)-critical graphs, Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor], Binding numbers for fractional ID-\(k\)-factor-critical graphs, A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH, NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS, Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties, Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs, A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs, Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs, BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS, STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new degree condition for graphs to have \([a,b\)-factor]
• On k-factor-critical graphs
• NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
• Independence number, connectivity, and r‐factors
• Stability number and [a,b‐factors in graphs]
• Notes on the binding numbers for (a, b, k)-critical graphs