Toughness and the existence of k-factors. II

DOI10.1007/BF01788075zbMath0652.05045OpenAlexW2033411095MaRDI QIDQ1106860

Hikoe Enomoto

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788075

zbMATH Keywords

Chvátal's conjecturek-factorsk-tough graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (8)

Minimum degree, independence number and regular factors ⋮ Factors and induced subgraphs ⋮ On the Toughness of a Graph ⋮ Toughness in graphs -- a survey ⋮ Bipartite toughness and \(k\)-factors in bipartite graphs ⋮ Unnamed Item ⋮ Toughness and the existence of \(k\)-factors. III ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted

Cites Work

• Unnamed Item
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• The Factors of Graphs

This page was built for publication: Toughness and the existence of k-factors. II