Graph colouring with no large monochronomatic components

DOI10.1017/S0963548308009140MaRDI QIDQ6829372zbMATH OpenFDO

Authors Nathan Linial, Jiří Matoušek, Or Sheffet, Gábor Tardos

Publication date 29 September 2008

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

graph colouringgraph minorsmonochromatic connected subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Graph minors (05C83)

This page was built for publication: Graph colouring with no large monochronomatic components

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