Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs
From MaRDI portal
Publication:6145817
DOI10.1016/j.dam.2023.11.045zbMath1530.05042OpenAlexW4389469357MaRDI QIDQ6145817
Cheng, T. C. Edwin, Fei Huang, Shan-Shan Guo, Jinjiang Yuan, C. T. Daniel Ng
Publication date: 9 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.11.045
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properly colored paths and cycles
- Hamiltonian circuits determining the order of chromosomes
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Rainbow triangles in edge-colored graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
- Properly Coloured Cycles and Paths: Results and Open Problems
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored 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 colored cycles in edge-colored 2-colored-triangle-free complete graphs