Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
From MaRDI portal
Publication:2124635
DOI10.1016/J.DISC.2022.112838zbMATH Open1486.05094OpenAlexW4211127835MaRDI QIDQ2124635FDOQ2124635
LuYi Li, Jinjiang Yuan, F. Huang
Publication date: 11 April 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.112838
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rainbow triangles in edge-colored graphs
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Some Theorems on Abstract Graphs
- Edge colorings of complete graphs without tricolored triangles
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- Color degree and alternating cycles in edge-colored graphs
- Properly colored paths and cycles
- 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
- Graphs with cycles having adjacent lines different colors
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Properly edge-colored theta graphs in edge-colored complete graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
Cited In (5)
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- 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
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
Recommendations
- Title not available (Why is that?) 👍 👎
- A generalization of properly colored paths and cycles in edge-colored graphs 👍 👎
- Edge-colored complete graphs containing no properly colored odd cycles 👍 👎
- Edge‐colored complete graphs without properly colored even cycles: A full characterization 👍 👎
- Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles 👍 👎
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs 👍 👎
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result 👍 👎
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles 👍 👎
- Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs 👍 👎
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles 👍 👎
This page was built for publication: Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124635)
