Decomposition of the complete graph plus a 1‐factor into cycles of equal length

DOI10.1002/jcd.10019zbMath1016.05058OpenAlexW1800155867MaRDI QIDQ4808410

Mateja Šajna

Publication date: 22 May 2003

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.10019

zbMATH Keywords

complete graphcycle decomposition, 1-factor

Mathematics Subject Classification ID

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

Related Items (5)

On \(\sigma \)-tripartite labelings of odd prisms and even Möbius ladders ⋮ Some equitably 3-colorable cycle decompositions of \(K_v + 1\) ⋮ Sunlet decomposition of certain equipartite graphs ⋮ Resolvable 4-cycle group divisible designs with two associate classes: part size even ⋮ Directed paths of diagonals within polygons

This page was built for publication: Decomposition of the complete graph plus a 1‐factor into cycles of equal length