scientific article; zbMATH DE number 165068

MaRDI QIDQ4032983zbMATHFDO

Authors Ciping Chen

Publication date 18 May 1993

zbMATH Keywords

toughness\(k\)-factorChvátal's conjecture\(k\)-tough graph

Mathematics Subject Classification ID

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

Recommendations

• Toughness and the existence ofk-factors
• Toughness and the existence of k-factors. II
• scientific article; zbMATH DE number 109208
• Toughness and the existence of \(k\)-factors. IV
• Toughness and the existence of \(k\)-factors. III

Cited in

(14)

• scientific article; zbMATH DE number 109208 (Why is no real title available?)
• Toughness of graphs and \([2,b]\)-factors
• Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties
• Toughness in graphs -- a survey
• scientific article; zbMATH DE number 682572 (Why is no real title available?)
• Toughness and the existence of \(k\)-factors. III
• \((3, k)\)-factor-critical graphs and toughness
• Chordality and 2-factors in tough graphs
• Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
• Toughness and the existence ofk-factors
• Toughness and the existence of k-factors. II
• Local topological toughness and local factors
• Properties of minimally \(t\)-tough graphs
• Toughness of Kronecker product of graphs.

This page was built for publication:

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