Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles

DOI10.1016/J.DAM.2021.01.032zbMATH Open1464.05211arXiv2007.14099OpenAlexW3045975840MaRDI QIDQ2656965FDOQ2656965

Publication date: 17 March 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: In an edge-colored graph

(G, c)

, let

d^{c} (v)

denote the number of colors on the edges incident with a vertex

v

of

G

and

d e l t a^{c} (G)

denote the minimum value of

d^{c} (v)

over all vertices

v i n V (G)

. 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 g e q 3

vertices is called properly vertex-pancyclic if each vertex of

(G, c)

is contained in a proper cycle of length

e l l

for every

e l l

with

3 l e e l l l e n

. Fujita and Magnant conjectured that every edge-colored complete graph on

n g e q 3

vertices with

d e l t a^{c} (G) g e q f r a c n + 1 2

is properly vertex-pancyclic. Chen, Huang and Yuan partially solve this conjecture by adding an extra condition that

(G, c)

does not contain any monochromatic triangle. In this paper, we show that this conjecture is true if the edge-colored complete graph contain no joint monochromatic triangles.

Full work available at URL: https://arxiv.org/abs/2007.14099

Recommendations

zbMATH Keywords

edge-colored graph color degree proper cycle properly vertex-pancyclicity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

Cited In (10)

This page was built for publication: Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656965)