Login / Signup

The interval number of a planar graph: Three intervals suffice.

Edward R. ScheinermanDouglas B. West
Published in: J. Comb. Theory, Ser. B (1983)
Keyphrases
  • computational complexity
  • special case
  • upper bound