Toughness of graphs and [2,b]-factors

DOI10.1007/BF02986653MaRDI QIDQ1334935zbMATH OpenFDO

Authors Ciping Chen

Publication date 26 September 1994

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02986653

zbMATH Keywords

\([a,b\)-factor]toughness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

It is proved that if a graph \(G\) has order at least 3, and \(b>2\), and for the toughness of \(G\) it holds \(\text{tough} (G) \geq 1 + {1 \over b}\), then \(G\) has a \([2,b]\)-factor. Moreover, it is shown that the thoughness condition in the above theorem cannot be replaced by \(\text{tough} (G) \geq 1 + {1 \over b} - \Theta\), where \(\Theta\) is any positive real number.

Recommendations

• Toughness of graphs and 2-factors with given properties.
• Toughness of graphs and the existence of factors
• scientific article; zbMATH DE number 109208
• (2,k)-factor-critical graphs and toughness
• scientific article; zbMATH DE number 165068
• Toughness and \([a,b]\)-factors in graphs.
• On toughness and \((g,f)\)-factors in bipartite graphs
• Two-tough graphs and f-factors with given properties
• Bipartite toughness and \(k\)-factors in bipartite graphs
• scientific article; zbMATH DE number 1496424

Cites work

• A simple existence criterion for \((g<f)\)-factors
• Graph theory with applications
• scientific article; zbMATH DE number 109208 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Toughness of graphs and the existence of factors

Cited in

(10)

• Toughness in graphs -- a survey
• Toughness for fractional \((2, b, k)\)-critical covered graphs
• Connected (g,f)-factors
• Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
• Two-tough graphs and f-factors with given properties
• scientific article; zbMATH DE number 109208 (Why is no real title available?)
• Toughness, minimum degree, and the existence of 2‐factors
• scientific article; zbMATH DE number 841562 (Why is no real title available?)
• Toughness and \([a,b]\)-factors in graphs.
• Toughness condition for a graph to be all fractional (g,f,n)-critical deleted

This page was built for publication: Toughness of graphs and \([2,b]\)-factors

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