Hamilton cycle rich 2-factorization of complete equipartite graphs. II

DOI10.1007/s00373-011-1083-5zbMath1256.05198OpenAlexW2073254963MaRDI QIDQ1928280

R. Sangeetha, Appu Muthusamy

Publication date: 3 January 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1083-5

zbMATH Keywords

decompositionHamilton cycle2-factorizationcomplete equipartite graph

Mathematics Subject Classification ID

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

Related Items

Hamilton cycle rich 2-factorization of complete bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamilton decomposable graphs with specified leaves
• The Hamilton-Waterloo problem for two even cycles factors
• Hamiltonian decomposition of Cayley graphs of degree 4
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• On the Hamilton-Waterloo problem
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• On bipartite 2-factorizations of kn − I and the Oberwolfach problem
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• Hamilton cycle rich two-factorizations of complete graphs