Login / Signup

A new lower bound on the number of edges in colour-critical graphs and hypergraphs.

Alexandr V. KostochkaMichael Stiebitz
Published in: J. Comb. Theory, Ser. B (2003)
Keyphrases
  • lower bound
  • upper bound
  • undirected graph
  • graph theory
  • weighted graph
  • finite number
  • search algorithm
  • computational complexity
  • small number
  • graph theoretic
  • randomized algorithm