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

DOI10.4134/BKMS.2008.45.1.053zbMath1143.05070OpenAlexW1978366995MaRDI QIDQ3514080

Si-zhong 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)

Related Items (2)

Toughness and \((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: BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS