Simple proofs of results on paths representing all colors in proper vertex-colorings

DOI10.1007/s00373-007-0694-3zbMath1116.05030OpenAlexW2028292094MaRDI QIDQ879947

Chiang Lin

Publication date: 10 May 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0694-3

zbMATH Keywords

Colorful pathPath representing all colorsVertex-coloring

Mathematics Subject Classification ID

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

Related Items (6)

Optimal colorings with rainbow paths ⋮ Colorings of complements of line graphs ⋮ Tropical dominating sets in vertex-coloured graphs ⋮ Colorful paths for 3-chromatic graphs ⋮ Tropical paths in vertex-colored graphs ⋮ Paths, cycles and circular colorings in digraphs

Cites Work

• A colourful path
• Nombre chromatique et plus longs chemins d'un graphe
• A generalization of the Gallai-Roy theorem
• Unnamed Item
• Unnamed Item

This page was built for publication: Simple proofs of results on paths representing all colors in proper vertex-colorings