Login / Signup

Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph.

Alex D. ScottPaul D. Seymour
Published in: J. Comb. Theory, Ser. B (2024)
Keyphrases
  • small number
  • upper bound
  • bipartite graph
  • spanning tree
  • minimum spanning tree
  • tree shaped