Toughness and the existence of k-factors. III

DOI10.1016/S0012-365X(98)00059-4MaRDI QIDQ1584359zbMATH OpenOpenAlexWikidataFDO

Authors 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

\(k\)-factorsChvátal's conjecturetoughness

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• (2,k)-factor-critical graphs and toughness
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1439475 (Why is no real title available?)
• Matching theory
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence of k-factors. IV
• Toughness and the existence of k-factors. II
• Toughness and the existence ofk-factors

Cited in

(24)

• Bipartite toughness and \(k\)-factors in bipartite graphs
• Toughness and the existence of k-factors. II
• Toughness and the existence of k-factors. IV
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• On \(P_{\geq 3}\)-factor deleted graphs
• Local topological toughness and local factors
• Toughness in graphs -- a survey
• scientific article; zbMATH DE number 5844238 (Why is no real title available?)
• DisjointT-paths in tough graphs
• scientific article; zbMATH DE number 165068 (Why is no real title available?)
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
• Feasibility of data transmission under attack: from isolated toughness variant perspective
• Factors, spectral radius and toughness in bipartite graphs
• Toughness and spectral radius in graphs
• A unified combinatorial view beyond some spectral properties
• Sharp isolated toughness bound for fractional \((k, m)\)-deleted graphs
• Spanning subgraphs and spectral radius in graphs
• Toughness, Hamiltonicity and eigenvalues of graphs
• Tight toughness variant condition for fractional k-factors
• Tight Toughness Bounds for Fractional ( k, n )-Critical Graphs with Large n
• Two variants of toughness of a graph and its eigenvalues
• Eigenvalues and toughness of regular graphs
• Toughness and distance spectral radius in graphs

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

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