Rainbow Hamiltonian cycles in strongly edge-colored graphs
From MaRDI portal
Publication:1727799
DOI10.1016/j.disc.2019.01.002zbMath1405.05094OpenAlexW2911648145WikidataQ128585573 ScholiaQ128585573MaRDI QIDQ1727799
Ta Sheng Tan, Yangyang Cheng, Qiang Sun, Guang-Hui Wang
Publication date: 20 February 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.01.002
Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (3)
Maximum properly colored trees in edge-colored graphs ⋮ Rainbow vertex-pancyclicity of strongly edge-colored graphs ⋮ Rainbow edge-pancyclicity of strongly edge-colored graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Existence of rainbow matchings in strongly edge-colored graphs
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
- A note on rainbow matchings in strongly edge-colored graphs
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree
- Rainbow matchings in strongly edge-colored graphs
- Rainbow Turán Problems
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- An Edge-Colored Version of Dirac's Theorem
- A Combinatorial Theorem
- Some Theorems on Abstract Graphs
This page was built for publication: Rainbow Hamiltonian cycles in strongly edge-colored graphs
