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

zbMATH Open1349.05280MaRDI QIDQ2804754FDOQ2804754

Sizhong Zhou

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

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 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)

Cited In (9)

• Title not available (Why is that?)
• A New Sufficient Condition for a Graph To Be (g, f, n)-Critical
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)