BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS

DOI10.4134/BKMS.2008.45.1.053MaRDI QIDQ3514080zbMATH OpenOpenAlexFDO

Authors Sizhong Zhou

Publication date 21 July 2008

Published in Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4134/bkms.2008.45.1.053

zbMATH Keywords

binding number

Mathematics Subject Classification ID

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

Recommendations

• Notes on the binding numbers for (a, b, k)-critical graphs
• A result on (a,b,k)-critical graphs.
• scientific article; zbMATH DE number 5777928
• scientific article; zbMATH DE number 6119662
• Binding numbers and (a,b,k)-critical graphs.

Cited in

(8)

• Toughness and (a,b,k)-critical graphs
• An optimal binding number condition for bipancyclism
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• A binding number condition for graphs to be (a, b, k)-critical graphs
• Binding numbers and (a,b,k)-critical graphs.
• scientific article; zbMATH DE number 6119662 (Why is no real title available?)
• A result on (a,b,k)-critical graphs.
• Notes on the binding numbers for (a, b, k)-critical graphs

This page was built for publication: BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS

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