A new sufficient condition for graphs to be (a,b,k)-critical graphs.

MaRDI QIDQ2804754zbMATH OpenFDO

Authors Sizhong Zhou

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

minimum degreeneighborhood\((a,b,k)\)-critical graph\([a,b\)-factor]

Mathematics Subject Classification ID

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

Recommendations

• Some new sufficient conditions for graphs to be \((a,b,k)\)-critical graphs.
• Remarks on neighborhoods of independent sets and \((a,b,k)\)-critical graphs
• (a,b,k)-critical graphs.
• NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
• scientific article; zbMATH DE number 5777928

Cited in

(13)

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

This page was built for publication: A new sufficient condition 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 Q2804754)