Rainbow vertex pair-pancyclicity of strongly edge-colored graphs

DOI10.46298/DMTCS.10142arXiv2210.05867MaRDI QIDQ6131792FDOQ6131792

Authors: F. Huang 

Publication date: 18 April 2024

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Abstract: An edge-colored graph is emph{rainbow }if no two edges of the graph have the same color. An edge-colored graph $G^c$ is called emph{properly colored} if every two adjacent edges of $G^c$ receive distinct colors in $G^c$. A emph{strongly edge-colored} graph is a proper edge-colored graph such that every path of length $3$ is rainbow. We call an edge-colored graph $G^c$ emph{rainbow vertex pair-pancyclic} if any two vertices in $G^c$ are contained in a rainbow cycle of length $ell$ for each $ell$ with $3leqellleqn$. In this paper, we show that every strongly edge-colored graph $G^c$ of order $n$ with minimum degree $deltageqfrac2n3+1$ is rainbow vertex pair-pancyclicity.

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

Recommendations

• Rainbow vertex-pancyclicity of strongly edge-colored graphs
• Rainbow edge-pancyclicity of strongly edge-colored graphs
• Rainbow pancyclicity and panconnectivity of strongly edge-colored graphs
• Rainbow Hamiltonian cycles in strongly edge-colored graphs
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three

zbMATH Keywords

edge-coloringrainbow cyclestrongly edge-colored graphrainbow vertex pair-pancyclicity

Mathematics Subject Classification ID

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

Cited In (1)

• Rainbow pancyclicity and panconnectivity of strongly edge-colored graphs

This page was built for publication: Rainbow vertex pair-pancyclicity of strongly edge-colored graphs

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