Color degree condition for long rainbow paths in edge-colored graphs

DOI10.1007/s40840-015-0179-0zbMath1343.05060OpenAlexW2187061546MaRDI QIDQ5964923

He Chen, Xue Liang Li

Publication date: 2 March 2016

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-015-0179-0

zbMATH Keywords

color degreecolor neighborhoodedge-colored graphrainbow heterochromatic pathrainbow multicolored path

Mathematics Subject Classification ID

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

Related Items

Note on rainbow cycles in edge-colored graphs ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total colorings of planar graphs with small maximum degree
• Equitable coloring and equitable choosability of planar graphs without 5- and 7-cycles
• Polychromatic Hamilton cycles
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Multicoloured Hamilton cycles
• Vertex-disjoint cycles of order eight with chords in a bipartite graph
• Total coloring of planar graphs without some chordal 6-cycles
• The linear arboricity of planar graphs without 5-cycles with chords
• Minimal colorings for properly colored subgraphs
• Long heterochromatic paths in edge-colored graphs
• Rainbow and orthogonal paths in factorizations ofKn
• Local Anti-Ramsey Numbers of Graphs