scientific article; zbMATH DE number 165068

zbMATH Open0770.05078MaRDI QIDQ4032983FDOQ4032983

Authors: Ciping Chen 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Toughness and the existence ofk-factors
• Toughness and the existence of k-factors. II
• scientific article
• Toughness and the existence of \(k\)-factors. IV
• Toughness and the existence of \(k\)-factors. III

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)

Cited In (14)

• Toughness in graphs -- a survey
• Toughness and the existence of k-factors. II
• Title not available (Why is that?)
• Toughness and the existence of \(k\)-factors. III
• Toughness and the existence ofk-factors
• Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
• \((3, k)\)-factor-critical graphs and toughness
• Chordality and 2-factors in tough graphs
• Local topological toughness and local factors
• Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties
• Toughness of graphs and \([2,b]\)-factors
• Toughness of Kronecker product of graphs.
• Properties of minimally \(t\)-tough graphs
• Title not available (Why is that?)

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)