| Publication type: |
 |
Article in peer-reviewed journal |
|
| Subject: |
|
Computer Science/Discrete Mathematics
|
|
| Title: |
|
Edge-Face Coloring of Plane Graphs with Maximum Degree Nine |
|
| Author(s): |
|
Jean-Sébastien Sereni ( ) 1, 2, Matej Stehlík () 3 |
|
| Laboratory: |
|
|
|
| Research team: |
|
OC |
| Abstract: |
|
An edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E ∪ F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1-3):21-33, 1994] proved that every plane graph of maximum degree ∆≥10 can be edge-face colored with ∆+1 colors. We extend Borodin's result to the case where ∆=9. |
|
| Fulltext language: |
|
English |
|
| Production date: |
|
2009-06 |
|
|
| Journal: |
|
| Journal of Graph Theory |
| Publisher |
Wiley-Blackwell |
| ISSN |
0364-9024 (eISSN : 1097-0118) |
|
|
| Audience: |
|
international |
|
| Publication date: |
|
2011-04 |
|
| Volume: |
|
66 |
|
| Issue: |
|
4 |
|
| Page, identifiant, ...: |
|
332-346 |
|
|
| Keyword(s): |
|
graph coloring – plane graph – edge-face coloring |
|
| Classification: |
|
05C15 |
|
| Internal note: |
|
OSP |
|
|
Export this paper
