Hamilton decomposable graphs with specified leaves
From MaRDI portal
Recommendations
- Hamilton decompositions of complete multipartite graphs with any 2‐factor leave
- Hamiltonian decompositions of complete graphs
- Hamilton decompositions of line graphs of some bipartite graphs
- Hamiltonian decomposition of complete regular multipartite digraphs
- Hamilton decompositions of complete graphs with a 3-factor leave.
Cited in
(16)- Enclosings of \(\lambda\)-fold 5-cycle systems for \(u = 2\)
- On the Hamilton-Waterloo problem for bipartite 2-factors
- Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
- Hamilton decompositions of graphs with primitive complements
- Recent advances on the Hamiltonian problem: survey III
- scientific article; zbMATH DE number 2147950 (Why is no real title available?)
- Hamilton cycle rich 2-factorizations of complete multipartite graphs
- Hamilton decompositions of complete graphs with a 3-factor leave.
- scientific article; zbMATH DE number 1420914 (Why is no real title available?)
- A survey on constructive methods for the Oberwolfach problem and its variants
- Hamilton cycle rich 2-factorization of complete equipartite graphs. II
- Hamilton cycle rich two-factorizations of complete graphs
- Hamilton cycle rich 2-factorization of complete bipartite graphs
- Hamilton decompositions of line graphs of some bipartite graphs
- Hamilton decompositions of complete multipartite graphs with any 2‐factor leave
- All graphs with maximum degree three whose complements have 4-cycle decompositions
This page was built for publication: Hamilton decomposable graphs with specified leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704849)
