Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties

DOI10.1007/s11425-011-4222-9zbMath1237.05171OpenAlexW2030195206MaRDI QIDQ763635

Qinglin Yu, ZeFang Wu, Gui Zhen Liu

Publication date: 29 March 2012

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-011-4222-9

zbMATH Keywords

toughness\([a, b\)-factor]inclusion\(/\)exclusion property

Mathematics Subject Classification ID

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

Related Items

Tree-core and tree-coritivity of graphs

Cites Work

• Toughness of graphs and the existence of factors
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• A remark on the factor theorems of lovász and tutte
• Orthogonal (g, f)-factorizations in networks
• Subgraphs with prescribed valencies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item