Minimum degree, independence number and (a,b,k)-critical graphs

zbMATH Open1289.05391MaRDI QIDQ5397245FDOQ5397245

Authors: Sizhong Zhou 

Publication date: 19 February 2014

Recommendations

• Independence number, connectivity and \((a,b,k)\)-critical graphs
• scientific article; zbMATH DE number 6119662
• A new sufficient condition for graphs to be \((a,b,k)\)-critical graphs.
• Remarks on neighborhoods of independent sets and \((a,b,k)\)-critical graphs
• Some new sufficient conditions for graphs to be \((a,b,k)\)-critical graphs.

zbMATH Keywords

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (8)

• Remarks on neighborhoods of independent sets and \((a,b,k)\)-critical graphs
• Title not available (Why is that?)
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Independence number and \([a,b]\)-factors of graphs.
• Stability number and minimum degree for (\(a, b, k\))-critical graphs

This page was built for publication: Minimum degree, independence number and \((a,b,k)\)-critical graphs

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