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

DOI10.1007/S00373-007-0694-3zbMATH Open1116.05030OpenAlexW2028292094MaRDI QIDQ879947FDOQ879947

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

Recommendations

• On proper-path colorings in graphs
• Properly coloured cycles and paths: Results and open problems
• Colorful paths in vertex coloring of graphs
• Properly colored paths and cycles in complete graphs
• scientific article
• Short proofs of coloring theorems on planar graphs
• A generalization of properly colored paths and cycles in edge-colored graphs
• A short proof of a conjecture on the connectivity of graph coloring complexes
• Colorful paths in vertex coloring of graphs.
• scientific article; zbMATH DE number 6453675

zbMATH Keywords

Colorful pathPath representing all colorsVertex-coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Nombre chromatique et plus longs chemins d'un graphe
• A colourful path
• A generalization of the Gallai-Roy theorem

Cited In (8)

• Tropical paths in vertex-colored graphs
• A note on the Gallai-Roy-Vitaver theorem
• Tropical dominating sets in vertex-coloured graphs
• Optimal colorings with rainbow paths
• Paths, cycles and circular colorings in digraphs
• A colourful path
• Colorful paths for 3-chromatic graphs
• Colorings of complements of line graphs

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

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