Login / Signup

Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps.

Alan GibbonsPaul Sant
Published in: MFCS (2002)
Keyphrases
  • binary trees
  • interactive theorem proving
  • series parallel
  • weighted graph
  • leaf nodes
  • approximation algorithms