Factorisations of 4-regular graphs and Petersen's theorem

DOI10.1006/jctb.1995.1014zbMath0820.05053OpenAlexW2089402305MaRDI QIDQ1892840

Gert Sabidussi, Mekkia Kouider

Publication date: 2 July 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1014

zbMATH Keywords

line graphperfect matchingPetersen's theorem2-factorisation

Mathematics Subject Classification ID

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

Related Items (3)

Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity ⋮ Triangle-free circuit decompositions and Petersen minor ⋮ Vertex-magic labelings of regular graphs. II.

This page was built for publication: Factorisations of 4-regular graphs and Petersen's theorem