A generalization of the Gallai-Roy theorem

DOI10.1007/PL00007256zbMath0989.05042OpenAlexW1986378997MaRDI QIDQ5956104

Hao Li

Publication date: 14 July 2002

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

Full work available at URL: https://doi.org/10.1007/pl00007256

zbMATH Keywords

directed graphchromatic numberdirected path

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Simple proofs of results on paths representing all colors in proper vertex-colorings ⋮ On the complexity of path problems in properly colored directed graphs ⋮ Tropical dominating sets in vertex-coloured graphs ⋮ Colorful paths for 3-chromatic graphs ⋮ On induced colourful paths in triangle-free graphs ⋮ Tropical paths in vertex-colored graphs ⋮ Using stable sets to bound the chromatic number ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Paths, cycles and circular colorings in digraphs

This page was built for publication: A generalization of the Gallai-Roy theorem