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

DOI10.1016/J.IPL.2010.03.005MaRDI QIDQ656581zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Tight toughness condition for fractional \((g,f,n)\)-critical graphs
• Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
• New toughness conditions for the fractional critical graphs
• Toughness and existence of fractional \((g,f)\)-factors in graphs
• Toughness and fractional critical deleted graph

Cites work

• scientific article; zbMATH DE number 5844238 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 2121690 (Why is no real title available?)
• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• Fractional \((g,f)\)-factors of graphs
• Graph theory
• Notes on the binding numbers for (a, b, k)-critical graphs
• On \((g,f,n)\)-critical graphs.
• On fractional \((f,n)\)-critical graphs
• Some results on fractional n-factor-critical graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and existence of fractional \((g,f)\)-factors in graphs
• Toughness and the existence of fractional k-factors of graphs
• \((a,b,k)\)-critical graphs.

Cited in

(10)

• Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
• Toughness and existence of fractional \((g,f)\)-factors in graphs
• Feasibility of data transmission under attack: from isolated toughness variant perspective
• On fractional fragility rates of graph classes
• scientific article; zbMATH DE number 6390837 (Why is no real title available?)
• Tight toughness condition for fractional \((g,f,n)\)-critical graphs
• A sufficient condition for a graph to be fractional \((k,n)\)-critical
• Toughness of the corona of two graphs
• Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
• New toughness conditions for the fractional critical graphs

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

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