Toughness of graphs and the existence of factors
From MaRDI portal
Publication:1813740
DOI10.1016/0012-365X(90)90297-UzbMath0739.05047WikidataQ127109471 ScholiaQ127109471MaRDI QIDQ1813740
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (21)
Sixty years of network reliability ⋮ Toughness of graphs and \([2,b\)-factors] ⋮ Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors] ⋮ A characterization of graphs having all \((g,f)\)-factors ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Toughness and \((a,b,k)\)-critical graphs ⋮ Graph toughness from Laplacian eigenvalues ⋮ Stability number and \(f\)-factors in graphs ⋮ Toughness and the existence of fractional \(k\)-factors of graphs ⋮ Toughness in graphs -- a survey ⋮ Connected (g, f)-factors ⋮ The existence of \(k\)-factors in squares of graphs ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Toughness and \([a, b\)-factors with inclusion\(/\)exclusion properties] ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ Some results on path-factor critical avoidable graphs ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS ⋮ Neighbourhood conditions for fractional ID-[a, b-factor-critical graphs]
Cites Work
This page was built for publication: Toughness of graphs and the existence of factors
