On toughness and fractional \((g,f,n)\)-critical graphs

DOI10.1016/j.ipl.2010.03.005zbMath1228.05241OpenAlexW1519432145MaRDI QIDQ656581

Shuli Liu

Publication date: 18 January 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.03.005

zbMATH Keywords

graphcombinatorial problemstoughnessfractional \((g,f,n)\)-critical graphfractional \((g,f)\)-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (3)

Toughness of the corona of two graphs ⋮ Feasibility of data transmission under attack: from isolated toughness variant perspective ⋮ Tight isolated toughness bound for fractional \((k, n)\)-critical graphs

Cites Work

• On fractional \((f,n)\)-critical graphs
• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• Some results on fractional \(n\)-factor-critical graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Tough graphs and Hamiltonian circuits.
• Notes on the binding numbers for (a, b, k)-critical graphs
• Fractional \((g,f)\)-factors of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On toughness and fractional \((g,f,n)\)-critical graphs