Characterization of edge-colored complete graphs with properly colored Hamilton paths
DOI10.1002/JGT.20188zbMATH Open1125.05037OpenAlexW4231579672MaRDI QIDQ3418198FDOQ3418198
Authors: Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, G. Gutin, Arash Rafiey, T. R. Jensen 
Publication date: 2 February 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20188
Recommendations
Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (16)
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Paths and trails in edge-colored graphs
- Proper Hamiltonian cycles in edge-colored multigraphs
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
- Properly coloured cycles and paths: Results and open problems
- Properly colored 2-factors of edge-colored complete bipartite graphs
- Dynamic cycles in edge-colored multigraphs
- Properly colored spanning trees in edge-colored graphs
- Properly coloured Hamiltonian paths in edge-coloured complete graphs
- Comment on ``Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles.
- Maximum properly colored trees in edge-colored graphs
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
- Cycles and paths in edge‐colored graphs with given degrees
- Long properly colored cycles in edge colored complete graphs
- Paths and Trails in Edge-Colored Graphs
This page was built for publication: Characterization of edge-colored complete graphs with properly colored Hamilton paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418198)
