Properly coloured Hamiltonian cycles in edge-coloured complete graphs
From MaRDI portal
Publication:1677578
DOI10.1007/s00493-015-3067-1zbMath1389.05043arXiv1212.6736OpenAlexW1547484769MaRDI QIDQ1677578
Publication date: 10 November 2017
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.6736
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (24)
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs ⋮ Cycle extension in edge-colored complete graphs ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ Maximum properly colored trees in edge-colored graphs ⋮ Compatible spanning circuits in edge-colored graphs ⋮ Properly colored 2-factors of edge-colored complete bipartite graphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Edge-disjoint properly colored cycles in edge-colored complete graphs ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ Properly edge-colored theta graphs in edge-colored complete graphs ⋮ Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result ⋮ Odd properly colored cycles in edge-colored graphs ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ Chinese postman problem on edge-colored multigraphs ⋮ A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs ⋮ Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs ⋮ Properly colored short cycles in edge-colored graphs ⋮ Compatible Hamilton cycles in random graphs ⋮ Rainbow edge-pancyclicity of strongly edge-colored graphs ⋮ Acyclic Digraphs ⋮ Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properly colored paths and cycles
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Color degree and alternating cycles in edge-colored graphs
- Graphs with cycles having adjacent lines different colors
- Alternating Hamiltonian cycles
- A property of the colored complete graph
- Properly coloured Hamiltonian paths in edge-coloured complete graphs
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Characterization of edge-colored complete graphs with properly colored Hamilton paths
- Long Alternating Cycles in Edge-Colored Complete Graphs
- An Edge-Colored Version of Dirac's Theorem
- A Dirac Type Condition for Properly Coloured Paths and Cycles
This page was built for publication: Properly coloured Hamiltonian cycles in edge-coloured complete graphs
