Decomposing 4-Regular Graphs into Triangle-Free 2-Factors

DOI10.1137/S089548019427144XzbMath0867.05054OpenAlexW2058677112MaRDI QIDQ4337729

Peter Horák, Edward A. Bertram

Publication date: 26 May 1997

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

Full work available at URL: https://doi.org/10.1137/s089548019427144x

zbMATH Keywords

decomposition2-factorpolynomial algorithmtriangle-free

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Graph factors and factorization: 1985--2003: a survey ⋮ Polyhedron of triangle-free simple 2-matchings in subcubic graphs ⋮ Triangle-free circuit decompositions and Petersen minor ⋮ Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5 − e)-free subgraphs

This page was built for publication: Decomposing 4-Regular Graphs into Triangle-Free 2-Factors