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

zbMATH Open1265.05514MaRDI QIDQ4649963FDOQ4649963

Authors: Zurun Xu, Minggang Zong, Sizhong Zhou 

Publication date: 15 November 2012

Recommendations

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

zbMATH Keywords

graphstability numberdegree conditionneighborhood union\([a,b\)-factor, \((a,b,k)\)-critical graph]

Mathematics Subject Classification ID

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

Cited In (13)

• Toughness and \((a,b,k)\)-critical graphs
• Title not available (Why is that?)
• A New Sufficient Condition for a Graph To Be (g, f, n)-Critical
• A new sufficient condition for graphs to be \((a,b,k)\)-critical graphs.
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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: 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)