Login / Signup

Extending partial 3-colourings in a planar graph.

Matt DeVosPaul D. Seymour
Published in: J. Comb. Theory, Ser. B (2003)
Keyphrases
  • planar graphs
  • np hard
  • pairwise
  • social network analysis
  • greedy algorithm
  • weighted graph