JOURNAL ARTICLE
Total colorings of planar graphs with large maximum degree
O. V. BorodinAlexandr KostochkaD. R. Woodall
Year: 1997 Journal: Journal of Graph Theory Vol: 26 (1)Pages: 53-59 Publisher: Wiley
Abstract
It is proved that a planar graph with maximum degree Δ ≥ 11 has total (vertex-edge) chromatic number $Delta; + 1. © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 53–59, 1997
Keywords:
Combinatorics Mathematics Planar graph Degree (music) Edge coloring Vertex (graph theory) Chromatic scale Graph Discrete mathematics Total coloring Outerplanar graph Graph power Pathwidth Line graph Physics
Metrics
63
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.46
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Total colorings of planar graphs with large maximum degree
O. V. BorodinAlexandr KostochkaDouglas R. Woodall
Journal: Journal of Graph Theory Year: 1997 Vol: 26 (1)Pages: 53-59
JOURNAL ARTICLE
Total colorings of planar graphs with maximum degree at least 8
Journal: Science in China Series A Mathematics Year: 2009 Vol: 52 (8)Pages: 1733-1742
JOURNAL ARTICLE
Total Colorings of $F_5$-Free Planar Graphs with Maximum Degree 8
Jian ChangJianliang WuHuijuan WangZhan-Hai Guo
Journal: The Electronic Journal of Combinatorics Year: 2014 Vol: 21 (1)
JOURNAL ARTICLE
Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
Journal: Journal of Combinatorial Optimization Year: 2019 Vol: 39 (1)Pages: 293-303
JOURNAL ARTICLE
(2,1)-total labelling of planar graphs with large maximum degree
Yong YuXin ZhangGuanghui WangGuizhen LiuJingbo Li
Journal: Journal of Discrete Mathematical Sciences and Cryptography Year: 2017 Vol: 20 (8)Pages: 1625-1636