More sufficient conditions for a graph to have factors

DOI10.1016/S0012-365X(97)00158-1zbMath0958.05106OpenAlexW2047534476MaRDI QIDQ1584225

Yunsun Nam, Richard P. Anstee

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00158-1

zbMATH Keywords

factorsdegree constrained subgraphsfractional subgraphs

Mathematics Subject Classification ID

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

Related Items (2)

Equitable factorizations of edge-connected graphs ⋮ Graph factors and factorization: 1985--2003: a survey

Cites Work

• Regular factors in nearly regular graphs
• Sufficient conditions for a graph to have factors
• Simplified existence theorems for \((g,f)\)-factors
• An algorithmic proof of Tutte's f-factor theorem
• Subgraphs with prescribed valencies

This page was built for publication: More sufficient conditions for a graph to have factors