Toughness of graphs and \([2,b]\)-factors

DOI10.1007/BF02986653zbMath0805.05061MaRDI QIDQ1334935

Chuanping Chen

Publication date: 26 September 1994

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (4)

Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Toughness in graphs -- a survey ⋮ Connected (g, f)-factors ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted

Cites Work

• A simple existence criterion for \((g<f)\)-factors
• Toughness of graphs and the existence of factors
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Unnamed Item
• Unnamed Item
• Unnamed Item

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