A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH

DOI10.1017/S001708951000011XzbMath1191.05076OpenAlexW2095104285MaRDI QIDQ3564624

Si-zhong Zhou

Publication date: 26 May 2010

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s001708951000011x

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)

A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs ⋮ An independent set degree condition for fractional critical deleted graphs

Cites Work

• Unnamed Item
• On fractional \((f,n)\)-critical graphs
• The stability number and connected \([k,k+1\)-factor in graphs]
• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Fan-type results for the existence of [\(a\),\(b\)-factors]
• Notes on the binding numbers for (a, b, k)-critical graphs

This page was built for publication: A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH