Colouring Eulerian triangulations

Joan Hutchinson, R. Bruce Richter, Paul Seymour

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


We show that for every orientable surface ∑ there is a number c so that every Eulerian triangulation of ∑ with representativeness ≥ c is 4-colourable.

Original languageEnglish (US)
Pages (from-to)225-239
Number of pages15
JournalJournal of Combinatorial Theory. Series B
Issue number2
StatePublished - 2002

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Colouring Eulerian triangulations'. Together they form a unique fingerprint.

Cite this