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

DOI10.1137/S089548019427144XMaRDI QIDQ4337729zbMATH OpenOpenAlexFDO

Authors Peter Horák, Edward 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

decompositiontriangle-free2-factorpolynomial algorithm

Mathematics Subject Classification ID

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

Cited in

(5)

• Graph factors and factorization: 1985--2003: a survey
• Decomposition of \(4k\)-regular graphs into \(k\, 4\)-regular \(K_5\)-free and \((K_5\text{-}e)\)-free subgraphs
• Polyhedron of triangle-free simple 2-matchings in subcubic graphs
• Factorisations of 4-regular graphs and Petersen's theorem
• Triangle-free circuit decompositions and Petersen minor

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

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