Chromatic Number of the Plane Meets Map Coloring: Townsend–Woodall’s 5-Color Theorem

2009 ◽  
pp. 209-223
Author(s):  
Alexander Soifer
Keyword(s):  
Chromatic Number ◽  
Map Coloring

scholarly journals Region Coloring in Minahasa Regency Using Sequential Color Algorithm

d'CARTESIAN ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 86
Author(s):  
Yevie Ingamita ◽  
Nelson Nainggolan ◽  
Benny Pinontoan
Keyword(s):  
Graph Theory ◽  
Positive Integer ◽  
Chromatic Number ◽  
Human Life ◽  
Minimum Number ◽  
Mathematical Sciences ◽  
Map Coloring ◽  
Graph Application

Graph Theory is one of the mathematical sciences whose application is very wide in human life. One of theory graph application is Map Coloring. This research discusses how to color the map of Minahasa Regency by using the minimum color that possible. The algorithm used to determine the minimum color in coloring the region of Minahasa Regency that is Sequential Color Algorithm. The Sequential Color Algorithm is an algorithm used in coloring a graph with k-color, where k is a positive integer. Based on the results of this research was found that the Sequential Color Algorithm can be used to color the map of Minahasa Regency with the minimum number of colors or chromatic number χ(G) obtained in the coloring of 25 sub-districts on the map of Minahasa Regency are 3 colors (χ(G) = 3).

Packing Chromatic Number of Cycle Related Graphs

2014 ◽  
Vol 4 (1) ◽  
pp. 27
Author(s):  
Albert William ◽  
Roy Santiago ◽  
Indra Rajasingh
Keyword(s):  
Chromatic Number ◽  
Packing Chromatic Number

Packing coloring on subdivision-vertex and subdivision-edge join of cycle Cm with path Pn

2020 ◽  
pp. 627-634
Author(s):  
K. Rajalakshmi ◽  
M. Venkatachalam ◽  
M. Barani ◽  
D. Dafik
Keyword(s):  
Chromatic Number ◽  
Path Graph ◽  
Packing Chromatic Number ◽  
Cycle Graph

The packing chromatic number $\chi_\rho$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $\pi$ from $V(G)$ to $\{1,2,...,k\}$ such that any two vertices of color $i$ are at distance at least $i+1$. In this paper, the authors find the packing chromatic number of subdivision vertex join of cycle graph with path graph and subdivision edge join of cycle graph with path graph.

scholarly journals On metric chromatic number of comb product of ladder graph

2021 ◽  
Vol 1836 (1) ◽  
pp. 012026
Author(s):  
M Y Rohmatulloh ◽  
Slamin ◽  
A I Kristiana ◽  
Dafik ◽  
R Alfarisi
Keyword(s):  
Chromatic Number ◽  
Ladder Graph
Sign in / Sign up

Export Citation Format

Share Document