Login / Signup

A bound on the chromatic number of the square of a planar graph.

Michael MolloyMohammad R. Salavatipour
Published in: J. Comb. Theory, Ser. B (2005)
Keyphrases
  • upper bound
  • worst case
  • random walk