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

zbMATH Open1349.05280MaRDI QIDQ2804754

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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (4)

Title not available (Why is that?) ⋮ \((a,b,k)\)-critical graphs ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)

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)