Notes on the binding numbers for (a, b, k)-critical graphs

DOI10.1017/S000497270003968XzbMath1183.05069MaRDI QIDQ5438368

Jiashang Jiang, Si-zhong Zhou

Publication date: 23 January 2008

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

zbMATH Keywords

critical graphspanning subgraphbinding number

Mathematics Subject Classification ID

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

Related Items

Toughness and \((a,b,k)\)-critical graphs ⋮ A binding number condition for graphs to be \((a, b, k)\)-critical graphs ⋮ Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor] ⋮ On toughness and fractional \((g,f,n)\)-critical graphs ⋮ A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH ⋮ Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs ⋮ Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs ⋮ Independence number, connectivity and \((a,b,k)\)-critical graphs

Cites Work

• A sufficient condition for a graph to have \([a,b\)-factors]
• Fan-type results for the existence of [\(a\),\(b\)-factors]
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Unnamed Item