scientific article; zbMATH DE number 6119662

MaRDI QIDQ4898155zbMATH OpenFDO

Authors Ziming Duan, Sizhong Zhou

Publication date 29 December 2012

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
• Notes on the binding numbers for (a, b, k)-critical graphs
• A binding number condition for graphs to be (a, b, k)-critical graphs
• Binding numbers and (a,b,k)-critical graphs.
• Minimum degree, independence number and (a,b,k)-critical graphs
• Binding number, minimum degree and bipancyclism in bipartite graphs
• Binding numbers for all fractional (a,b,k)-critical graphs
• Binding number, minimum degree and \((g,f)\)-factors of graphs
• Stability number and minimum degree for (a, b, k)-critical graphs

Cited in

(9)

• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• Toughness and (a,b,k)-critical graphs
• Stability number and minimum degree for (a, b, k)-critical graphs
• BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
• A binding number condition for graphs to be (a, b, k)-critical graphs
• Binding numbers and (a,b,k)-critical graphs.
• A result on (a,b,k)-critical graphs.
• Minimum degree, independence number and (a,b,k)-critical graphs
• Notes on the binding numbers for (a, b, k)-critical graphs

This page was built for publication:

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