Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5 − e)-free subgraphs

DOI10.47443/DML.2021.S104zbMath1499.05519OpenAlexW4239173476MaRDI QIDQ5862695

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

Publication date: 9 March 2022

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

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

zbMATH Keywords

decompositionEulerian graphsEuler toursforbidden subgraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• P4-decompositions of regular graphs
• Almost all regular graphs are hamiltonian
• Decomposing 4-Regular Graphs into Triangle-Free 2-Factors
• Proof of the 1-factorization and Hamilton Decomposition Conjectures

This page was built for publication: Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5 − e)-free subgraphs