Simple proofs of results on paths representing all colors in proper vertex-colorings
type: Item
instance of: scholarly article
title: Simple proofs of results on paths representing all colors in proper vertex-colorings
zbMATH Open document ID: 1116.05030
author: Chiang Lin
published in: Graphs and Combinatorics
publication date: 2007-05-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5151322
zbMATH Keywords: Vertex-coloring
zbMATH Keywords: Colorful path
zbMATH Keywords: Path representing all colors
MaRDI profile type: Publication
full work available at URL: s00373-007-0694-3
OpenAlex ID: W2028292094
cites work: Q3097395
cites work: A colourful path
cites work: A generalization of the Gallai-Roy theorem
cites work: Nombre chromatique et plus longs chemins d'un graphe
cites work: Q4869540
DOI: 10.1007/S00373-007-0694-3
Recommended article: On proper-path colorings in graphs
Recommended article: Properly Coloured Cycles and Paths: Results and Open Problems
Recommended article: Colorful paths in vertex coloring of graphs
Recommended article: Properly colored paths and cycles in complete graphs
Recommended article: Q3178806
Recommended article: Short proofs of coloring theorems on planar graphs
Recommended article: A generalization of properly colored paths and cycles in edge-colored graphs
Recommended article: A short proof of a conjecture on the connectivity of graph coloring complexes
Recommended article: Colorful paths in vertex coloring of graphs.
Recommended article: Q5260297
description: scientific article; zbMATH DE number 5151322