Back to Search
Start Over
Grünbaum colorings of triangulations on the projective plane
- Source :
- Discrete Applied Mathematics. 215:155-163
- Publication Year :
- 2016
- Publisher :
- Elsevier BV, 2016.
-
Abstract
- A Grunbaum coloring of a triangulation G on a surface is a 3-edge coloring of G such that each face of G receives three distinct colors on its boundary edges. In this paper, we prove that every Fisk triangulation on the projective plane P has a Grunbaum coloring, where a "Fisk triangulation" is one with exactly two odd degree vertices such that the two odd vertices are adjacent. To prove the theorem, we establish a generating theorem for Fisk triangulations on P . Moreover, we show that a triangulation G on P has a Grunbaum coloring with each color-induced subgraph connected if and only if every vertex of G has even degree.
- Subjects :
- Triangulation (topology)
Pitteway triangulation
Degree (graph theory)
Applied Mathematics
0102 computer and information sciences
02 engineering and technology
Complete coloring
01 natural sciences
Vertex (geometry)
Combinatorics
010201 computation theory & mathematics
0202 electrical engineering, electronic engineering, information engineering
Discrete Mathematics and Combinatorics
020201 artificial intelligence & image processing
Projective plane
Fractional coloring
Point set triangulation
Mathematics
Subjects
Details
- ISSN :
- 0166218X
- Volume :
- 215
- Database :
- OpenAIRE
- Journal :
- Discrete Applied Mathematics
- Accession number :
- edsair.doi...........3222b5872c4c8c8fe529d9e8012568f8
- Full Text :
- https://doi.org/10.1016/j.dam.2016.07.012