A sufficient condition for a graph to be fractional \((k,n)\)-critical

DOI10.1016/J.DISC.2024.114008MaRDI QIDQ6494951

Wei Fan Wang, Wei Gao, Yi Qiao Wang

Publication date: 30 April 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

fractional \(k\)-factorgraph toughnessfractional \((k, n)\)-critical graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• On toughness and fractional \((g,f,n)\)-critical graphs
• Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Tough graphs and Hamiltonian circuits.
• Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

This page was built for publication: A sufficient condition for a graph to be fractional \((k,n)\)-critical