Mod 3 arithmetic on triangulated Riemann surfaces

DOI10.1016/S0304-3975(00)00236-XzbMath0972.05020OpenAlexW2087625059WikidataQ126377339 ScholiaQ126377339MaRDI QIDQ5941507

Edouard G. Belaga

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00236-x

zbMATH Keywords

triangulationlabellingRiemann surfacecounting problemfour-colour problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• The four color proof suffices
• Percy John Heawood
• Constructions of covering triangulations with folds
• Every Planar Map is Four Colorable
• On Extended Congruences Connected with the Four-Colour Map Theorem
• On the Enumeration of Four-Colored Maps
• Failures in Congruences Connected with the Four-Colour Map Theorem
• Branched and folded coverings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mod 3 arithmetic on triangulated Riemann surfaces