Hamilton cycle rich 2-factorization of complete bipartite graphs

DOI10.1142/S1793830915500263zbMath1336.05109OpenAlexW1859687026MaRDI QIDQ3451064

R. Sangeetha, Appu Muthusamy

Publication date: 10 November 2015

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830915500263

zbMATH Keywords

decompositionbipartite graphHamilton cycle2-factorization

Mathematics Subject Classification ID

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

Cites Work

• Hamilton decomposable graphs with specified leaves
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• Hamilton cycle rich 2-factorization of complete equipartite graphs. II
• 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
• Hamilton cycle rich two-factorizations of complete graphs
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem

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