The Chromatic Number of the Square of a Planar Graph
碩士 === 國立臺灣師範大學 === 數學系 === 102 === Discharging method was proposed in 1977 by Appel and Haken, he used it to prove that for any planar graph G, χ(G)≤4, that is well-known 4-Color Theorem. Heuvel et al. used discharging method to prove χ(G^2 )≤2"Δ"+25 in 1999. In this paper, we reduce thi...
Main Author: | 王博賢 |
---|---|
Other Authors: | 郭君逸 |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/77897557535000762382 |
Similar Items
-
Strong oriented chromatic number of planar graphs without short cycles
by: Mickaël Montassier, et al.
Published: (2008-01-01) -
Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
by: Borodin Oleg V., et al.
Published: (2013-09-01) -
The fractional chromatic number and the circular chromatic number of circulant graphs
by: C. U. Liao, et al. -
Monotone Chromatic Number of Graphs
by: Anwar Saleh, et al.
Published: (2020-09-01) -
Neighbor Sum Distinguishing Total Chromatic Number of Planar Graphs without 5-Cycles
by: Zhao Xue, et al.
Published: (2020-02-01)