Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs

DOI10.1016/j.ejc.2015.02.014zbMath1315.05046OpenAlexW2055139832MaRDI QIDQ2346583

L. Sunil Chandran, Deepak Rajendraprasad, Jasine Babu

Publication date: 2 June 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.02.014

zbMATH Keywords

length of a maximum heterochromatic path

Mathematics Subject Classification ID

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

Related Items (5)

Zeons, orthozeons, and graph colorings ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ Rainbow Turán problems for paths and forests of stars ⋮ Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees ⋮ Combinatorial optimization. Abstracts from the workshop held November 4--10, 2018

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow path and color degree in edge colored graphs
• Polychromatic Hamilton cycles
• Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• The Moore bound for irregular graphs
• Multicoloured Hamilton cycles
• Explicit construction of graphs with an arbitrary large girth and of large size
• Long heterochromatic paths in edge-colored graphs
• Large Rainbow Matchings in Edge-Coloured Graphs
• Long heterochromatic paths in heterochromatic triangle free graphs

This page was built for publication: Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs