Martingales on Trees and the Empire Chromatic Number of Random Trees

DOI10.1007/978-3-642-03409-1_8zbMath1251.05055OpenAlexW13416703MaRDI QIDQ3183598

Colin Cooper, Andrew R. A. McGrae, Michele Zito

Publication date: 20 October 2009

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03409-1_8

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items

Distribution of tree parameters by martingale approach ⋮ The complexity of the empire colouring problem for linear forests ⋮ The complexity of the empire colouring problem ⋮ Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem ⋮ The average number of spanning trees in sparse graphs with given degrees

This page was built for publication: Martingales on Trees and the Empire Chromatic Number of Random Trees