Variations on the Roy-Gallai theorem

DOI10.1007/s10288-004-0043-9zbMath1098.05035OpenAlexW2074959750MaRDI QIDQ816578

Pierre Hansen, Dominique de Werra

Publication date: 9 March 2006

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/269710/files/10288_2004_Article_43.pdf

zbMATH Keywords

stable setgraph colouringchromatic numberlongest pathpanchromatic chain

Mathematics Subject Classification ID

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

Related Items

On the complexity of path problems in properly colored directed graphs, On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem, Locally restricted colorings