Toughness and the existence of \(k\)-factors. III

DOI10.1016/S0012-365X(98)00059-4zbMath0955.05085OpenAlexW4213314029WikidataQ126804749 ScholiaQ126804749MaRDI QIDQ1584359

Hikoe Enomoto

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00059-4

zbMATH Keywords

toughnessChvátal's conjecture\(k\)-factors

Mathematics Subject Classification ID

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

Related Items (6)

Feasibility of data transmission under attack: from isolated toughness variant perspective ⋮ Toughness in graphs -- a survey ⋮ Bipartite toughness and \(k\)-factors in bipartite graphs ⋮ Unnamed Item ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted ⋮ On \(P_{\geq 3}\)-factor deleted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Toughness and the existence of k-factors. II
• \((2,k)\)-factor-critical graphs and toughness
• Toughness and the existence of \(k\)-factors. IV
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors

This page was built for publication: Toughness and the existence of \(k\)-factors. III