Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
From MaRDI portal
Publication:2656965
DOI10.1016/j.dam.2021.01.032zbMath1464.05211arXiv2007.14099OpenAlexW3045975840MaRDI QIDQ2656965
Publication date: 17 March 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.14099
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Properly colored 2-factors of edge-colored complete bipartite graphs ⋮ Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs ⋮ Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Chinese postman problem on edge-colored multigraphs
- Properly colored paths and cycles
- Alternating Hamiltonian cycles
- Hamiltonian circuits determining the order of chromosomes
- A note on alternating cycles in edge-coloured graphs
- Properly coloured Hamiltonian paths in edge-coloured complete graphs
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Exact approaches for the orderly colored longest path problem: performance comparison
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- The rainbow spanning forest problem
- Compatible spanning circuits in edge-colored graphs
- Two heuristics for the rainbow spanning forest problem
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- Optimal pathway reconstruction on 3D NMR maps
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Paths and trails in edge-colored graphs
- The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
- Some Theorems on Abstract Graphs
This page was built for publication: Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
