Hamilton cycle rich 2-factorization of complete bipartite graphs
From MaRDI portal
Recommendations
- Hamilton cycle rich 2-factorization of complete equipartite graphs. II
- Hamilton cycle rich 2-factorizations of complete multipartite graphs
- Hamilton cycle rich two-factorizations of complete graphs
- On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
- On the Hamilton-Waterloo problem for bipartite 2-factors
Cites work
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- 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
- Hamilton cycle rich two-factorizations of complete graphs
- Hamilton decomposable graphs with specified leaves
- Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
- On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
Cited in
(7)- Hamilton cycle rich 2-factorization of complete equipartite graphs. II
- On 2-factor Hamiltonian regular bipartite graphs
- Hamilton cycle rich 2-factorizations of complete multipartite graphs
- Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
- Hamilton cycle rich two-factorizations of complete graphs
- Connected bipancyclic isomorphic m-factorizations of the Cartesian product of graphs
- scientific article; zbMATH DE number 3993620 (Why is no real title available?)
This page was built for publication: Hamilton cycle rich 2-factorization of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451064)
