Variations on the Roy-Gallai theorem

From MaRDI portal

Revision as of 11:06, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:816578

Jump to:navigation, search

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 set graph colouring chromatic number longest path panchromatic chain

Mathematics Subject Classification ID

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

Related Items (3)

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

This page was built for publication: Variations on the Roy-Gallai theorem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:816578&oldid=12756924"