Abstract
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 language | English (US) |
---|---|
Pages (from-to) | 225-239 |
Number of pages | 15 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 84 |
Issue number | 2 |
DOIs | |
State | Published - 2002 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics