Back to Search
Start Over
On the complete chromatic number of Halin graphs
- Source :
- Acta Mathematicae Applicatae Sinica. 13:102-106
- Publication Year :
- 1997
- Publisher :
- Springer Science and Business Media LLC, 1997.
-
Abstract
- LetG be a planar graph with δ(G)≥3,f 0 be a face ofG. In this paper it is proved that for any Halin graph with Δ(G)≥6,x c (G)=Δ(G)+1, where Δ(G),x c (G) denote the maximum degree and the complete chromatic number ofG, respectively.
Details
- ISSN :
- 16183932 and 01689673
- Volume :
- 13
- Database :
- OpenAIRE
- Journal :
- Acta Mathematicae Applicatae Sinica
- Accession number :
- edsair.doi...........9bd818c50e3047b6ee5af3b563a5e306
- Full Text :
- https://doi.org/10.1007/bf02020485