Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
From MaRDI portal
Publication:2312662
DOI10.1016/j.dam.2019.03.011zbMath1416.05102OpenAlexW2928220987WikidataQ128137819 ScholiaQ128137819MaRDI QIDQ2312662
Xiaozheng Chen, Fei Huang, Jinjiang Yuan
Publication date: 17 July 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.03.011
Related Items (7)
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ 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 ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Properly colored paths and cycles
- Color degree and alternating cycles in edge-colored graphs
- Graphs with cycles having adjacent lines different colors
- A property of the colored complete graph
- Hamiltonian circuits determining the order of chromosomes
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Properly edge-colored theta graphs in edge-colored complete graphs
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Long properly colored cycles in edge colored complete graphs
- Rainbow triangles in edge-colored graphs
- Edge colorings of complete graphs without tricolored triangles
- 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
- Digraphs
- Some Theorems on Abstract Graphs
This page was built for publication: Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles