Sharp isolated toughness bound for fractional \((k, m)\)-deleted graphs

DOI10.1007/S10255-024-1067-XMaRDI QIDQ6661719

Yaojun Chen, Weifan Wang, Wei Gao

Publication date: 13 January 2025

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

fractional \((k, m)\)-deleted graphfractional \(k\)-factorisolated toughness

Mathematics Subject Classification ID

Fractional graph theory, fuzzy graph theory (05C72)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A minimum degree condition of fractional \((k,m)\)-deleted graphs
• Toughness and the existence of k-factors. II
• Toughness and the existence of \(k\)-factors. IV
• Toughness and the existence of \(k\)-factors. III
• Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
• On path-factor critical deleted (or covered) graphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Tough graphs and Hamiltonian circuits.
• Fractional \((g,f)\)-factors in graphs
• New isolated toughness condition for fractional $(g,f,n)$-critical graphs
• A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS
• Toughness and the existence ofk-factors
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

This page was built for publication: Sharp isolated toughness bound for fractional \((k, m)\)-deleted graphs

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