Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps.
Alan Gibbons
,
Paul Sant
Venue
B
MFCS
Year
2002
Proceedings
MFCS
DBLP record
conf/mfcs/GibbonsS02 ↗
Browse the full
MFCS paper archive
.