Large sets of Hamilton cycle and path decompositions
From MaRDI portal
Recommendations
- Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
- Publication:4489189
- Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs
- Large sets of Hamilton cycle decompositions of complete bipartite graphs
- On large sets of almost Hamilton cycle decompositions
Cites work
- scientific article; zbMATH DE number 1472137 (Why is no real title available?)
- scientific article; zbMATH DE number 4195963 (Why is no real title available?)
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Row-complete latin squares of every composite order exist
- The spectrum for large sets of disjoint mendelsohn triple systems with any index
Cited in
(9)- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
- On large sets of almost Hamilton cycle decompositions
- Combinatorial properties of the G-degree
- Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs
- Large sets of Hamilton cycle decompositions of complete bipartite graphs
- A new class for large sets of almost Hamilton cycle decompositions
- Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
- Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
- scientific article; zbMATH DE number 1472137 (Why is no real title available?)
This page was built for publication: Large sets of Hamilton cycle and path decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947816)