Regular factors in nearly regular graphs

DOI10.1016/0012-365X(84)90030-XzbMath0543.05051OpenAlexW2090850098MaRDI QIDQ795844

Jean-Claude Bermond, Michel Las Vergnas

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90030-x

zbMATH Keywords

regular graphf-factor

Mathematics Subject Classification ID

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

Related Items (5)

A note on f-factors in directed and undirected multigraphs ⋮ Equitable factorizations of edge-connected graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ More sufficient conditions for a graph to have factors ⋮ Sufficient conditions for a graph to have factors

Cites Work

• Three short proofs in graph theory
• Graphs and Subgraphs
• The Factorization of Linear Graphs
• The Factorization of Locally Finite Graphs
• On factorisation of graphs
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: Regular factors in nearly regular graphs