Toughness and [a,b]-factors in graphs.

MaRDI QIDQ4924917zbMATH OpenFDO

Authors Renying Chang, Yan Zhu, Guizhen Liu

Publication date 10 June 2013

zbMATH Keywords

\([a,b\)-factor]fractional factortoughness

Mathematics Subject Classification ID

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

Recommendations

• Toughness and \([a,b]\)-factors with prescribed properties.
• Toughness of graphs and \([2,b]\)-factors
• scientific article; zbMATH DE number 5844238
• scientific article; zbMATH DE number 109208
• Toughness and (a,b,k)-critical graphs

Cited in

(8)

• Toughness of graphs and \([2,b]\)-factors
• Toughness condition for the existence of all fractional (a, b, k)-critical graphs
• Toughness of Kronecker product of graphs.
• Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
• scientific article; zbMATH DE number 109208 (Why is no real title available?)
• Toughness and \([a,b]\)-factors with prescribed properties.
• Isolated toughness and existence of \([a,b]\)-factors in graphs
• Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties

This page was built for publication: Toughness and \([a,b]\)-factors in graphs.

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