Some new sufficient conditions for graphs to be (a,b,k)-critical graphs.

MaRDI QIDQ4649963zbMATH OpenFDO

Authors Zurun Xu, Minggang Zong, Sizhong Zhou

Publication date 15 November 2012

zbMATH Keywords

\([a,b\)-factor, \((a,b,k)\)-critical graph]degree conditiongraphneighborhood unionstability number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A new sufficient condition for graphs to be (a,b,k)-critical graphs.
• (a,b,k)-critical graphs.
• scientific article; zbMATH DE number 5777928
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• A result on (a,b,k)-critical graphs.

Cited in

(14)

• Independence number, connectivity and \((a,b,k)\)-critical graphs
• (a,b,k)-critical graphs
• Toughness and (a,b,k)-critical graphs
• (a,b,k)-critical graphs.
• A new sufficient condition for graphs to be (a,b,k)-critical graphs.
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• scientific article; zbMATH DE number 5846957 (Why is no real title available?)
• NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
• A New Sufficient Condition for a Graph To Be (g, f, n)-Critical
• scientific article; zbMATH DE number 5733928 (Why is no real title available?)
• scientific article; zbMATH DE number 5777928 (Why is no real title available?)
• scientific article; zbMATH DE number 2073945 (Why is no real title available?)
• Minimum degree, independence number and (a,b,k)-critical graphs
• Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical

This page was built for publication: Some new sufficient conditions for graphs to be \((a,b,k)\)-critical graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649963)