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

DOI10.1007/S00373-011-1083-5MaRDI QIDQ1928280zbMATH OpenOpenAlexFDO

Authors R. Sangeetha, A. 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

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

Recommendations

• Hamilton cycle rich 2-factorization of complete bipartite graphs
• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• Hamilton cycle rich two-factorizations of complete graphs
• Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
• Bipartite 2-factorizations of complete multipartite graphs

Cites work

• scientific article; zbMATH DE number 192864 (Why is no real title available?)
• scientific article; zbMATH DE number 2147950 (Why is no real title available?)
• scientific article; zbMATH DE number 749264 (Why is no real title available?)
• scientific article; zbMATH DE number 3349817 (Why is no real title available?)
• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• Hamilton cycle rich two-factorizations of complete graphs
• Hamilton decomposable graphs with specified leaves
• Hamiltonian decomposition of Cayley graphs of degree 4
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• On the Hamilton-Waterloo problem
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem for two even cycles factors
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors

Cited in

(10)

• Maximal sets of 2-factors in complete equipartite graphs
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• The spectrum of 4-cycles in 2-factorizations of \(K_{n,n}\).
• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• Pancomponented 2-factorizations of complete graphs
• Hamilton cycle rich two-factorizations of complete graphs
• Hamilton cycle rich 2-factorization of complete bipartite graphs
• Bipartite 2-factorizations of complete multipartite graphs
• scientific article; zbMATH DE number 3993620 (Why is no real title available?)
• Hamilton decompositions of complete multipartite graphs with any 2‐factor leave

This page was built for publication: Hamilton cycle rich 2-factorization of complete equipartite graphs. II

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