Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40+1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2013-09-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1708 |