Login / Signup

A list version of Dirac's theorem on the number of edges in colour-critical graphs.

Alexandr V. KostochkaMichael Stiebitz
Published in: J. Graph Theory (2002)
Keyphrases
  • small number
  • directed graph
  • undirected graph
  • computational complexity
  • fixed number
  • search algorithm
  • graph theory
  • graph structure