Decomposition of 4k-regular graphs into k\, 4-regular K₅-free and (K₅-e)-free subgraphs

DOI10.47443/DML.2021.S104MaRDI QIDQ5862695zbMATH OpenOpenAlexFDO

Authors Rachel T. Johnson, David Mendel, Samantha Norris, Shailesh K. Tipnis, Michael J. Plantholt

Publication date 9 March 2022

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47443/dml.2021.s104

zbMATH Keywords

decompositionEuler toursEulerian graphsforbidden subgraph

Mathematics Subject Classification ID

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

Recommendations

• P4-decompositions of regular graphs
• Decompositions of triangle-free 5-regular graphs into paths of length five
• On decomposing even regular multigraphs into small isomorphic trees
• Decomposing 2k-regular graphs into paths of length k
• Decomposing 10-regular graphs into paths of length 5

Cites work

• Almost all regular graphs are hamiltonian
• Decomposing 4-Regular Graphs into Triangle-Free 2-Factors
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• P4-decompositions of regular graphs
• Proof of the 1-factorization and Hamilton Decomposition Conjectures

Cited in

(3)

• Decomposing 10-regular graphs into paths of length 5
• On decomposing even regular multigraphs into small isomorphic trees
• Decomposition of \({\lambda K}_v\) into multigraphs with four vertices and five edges

This page was built for publication: Decomposition of \(4k\)-regular graphs into \(k\, 4\)-regular \(K_5\)-free and \((K_5\text{-}e)\)-free subgraphs

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