scientific article; zbMATH DE number 109208

zbMATH Open0767.05067MaRDI QIDQ4024344FDOQ4024344

Authors: Ciping Chen, Guizhen Liu 

Publication date: 9 March 1993

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

Recommendations

• scientific article
• Toughness and the existence ofk-factors
• Toughness of graphs and the existence of factors
• Toughness of graphs and \([2,b]\)-factors
• Toughness and \([a,b]\)-factors in graphs.

zbMATH Keywords

toughnessfactorChvátal's conjecture

Mathematics Subject Classification ID

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

Cited In (16)

• Factors, spectral radius and toughness in bipartite graphs
• Two-tough graphs and \(f\)-factors with given properties
• On \((g,f)\)-uniform graphs
• 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
• DisjointT-paths in tough graphs
• Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
• Local topological toughness and local factors
• Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties
• Matching extension and matching exclusion via the size or the spectral radius of graphs
• Toughness of graphs and \([2,b]\)-factors
• Toughness and \([a,b]\)-factors in graphs.
• Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors
• Properties of minimally \(t\)-tough 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 Q4024344)