May 15, 2021 · In this paper, we show that this conjecture is true if the edge-colored complete graph contain no joint monochromatic triangles. Previous ...

Jul 28, 2020 · A cycle of (G,c) is called proper if any two adjacent edges of the cycle have distinct colors. An edge-colored graph (G,c) on n\geq 3 vertices ...

Jan 29, 2021 · In this paper, we show that this conjecture is true if the edge-colored complete graph contain no joint monochromatic triangles. Keywords: edge- ...

Jul 28, 2020 · A cycle of $(G,c)$ is called proper if any two adjacent edges of the cycle have distinct colors. An edge-colored graph $(G,c)$ on $n\geq 3$ ...

Jul 28, 2020 · In this paper, we show that this conjecture is true if the edge-colored complete graph contain no joint monochromatic triangles. Keywords: edge- ...

Fujita and Magnant conjectured that every edge-colored complete graph on n≥3 vertices with δc(G)≥n+12 is properly vertex-pancyclic. We show that this conjecture ...

An edge-colored graph is called rainbow if every two edges receive distinct colors, and called proper if every two adjacent edges receive distinct colors.

An edge-colored graph ( G , c ) on n ≥ 3 vertices is called properly vertex-pancyclic if each vertex of ( G , c ) is contained in a proper cycle of length ℓ for ...

Nov 20, 2023 · An edge-colored graph G c is properly vertex/edge-pancyclic if every vertex/edge of the graph is contained in a proper cycle of length k for ...