On a problem of G. Hahn about coloured Hamiltonian paths in K₂n
From MaRDI portal
Publication:800377
Recommendations
Cited in
(25)- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Edge-disjoint rainbow trees in properly coloured complete graphs
- Rainbow Hamiltonian cycles in strongly edge-colored graphs
- Polychromatic cliques
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs
- Rainbow spanning trees in abelian groups
- Long directed rainbow cycles and rainbow spanning trees
- Embedding rainbow trees with applications to graph labelling and decomposition
- Rainbow vertex-pancyclicity of strongly edge-colored graphs
- Decompositions into isomorphic rainbow spanning trees
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path
- The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
- scientific article; zbMATH DE number 7449553 (Why is no real title available?)
- scientific article; zbMATH DE number 4137782 (Why is no real title available?)
- Rainbow Turán problems for paths and forests of stars
- Rainbow structures in locally bounded colorings of graphs
- A rainbow Dirac's theorem
- Lower bounds for rainbow Turan numbers of paths and other trees
- scientific article; zbMATH DE number 7771745 (Why is no real title available?)
- Hamilton transversals in random Latin squares
- On the rainbow Turán number of paths
- Linearly many rainbow trees in properly edge-coloured complete graphs
- Towards Graham's rearrangement conjecture via rainbow paths
This page was built for publication: On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800377)