A Map Coloring Problem

2016 ◽  
pp. 63-66
Author(s):  
Ping Zhang
Keyword(s):  
Coloring Problem ◽  
Map Coloring

Quick Reads: Map Coloring: A Student's Perspective

2012 ◽  
Vol 17 (8) ◽  
pp. 502-504
Author(s):  
John Matthew Nicklas
Keyword(s):  
Middle School ◽  
Middle School Student ◽  
Advanced Mathematics ◽  
Coloring Problem ◽  
Map Coloring

A middle school student worked on a map coloring problem, which motivated him to explore advanced mathematics.

scholarly journals Solution of the heawood map-coloring problem—Case 4

1970 ◽  
Vol 8 (2) ◽  
pp. 170-174 ◽  
Author(s):  
C.M. Terry ◽  
L.R. Welch ◽  
J.W.T. Youngs
Keyword(s):  
Coloring Problem ◽  
Problem Case ◽  
Map Coloring

Applying oonn to solve map-coloring problem

1993 ◽  
Vol 10 (1) ◽  
pp. 9-14
Author(s):  
Yu Daoheng ◽  
Jia Jiyou
Keyword(s):  
Coloring Problem ◽  
Map Coloring

On the Genus of Strong Tensor Products of Graphs

1976 ◽  
Vol 28 (3) ◽  
pp. 523-532 ◽  
Author(s):  
B. L. Garman ◽  
R. D. Ringeisen ◽  
A. T. White
Keyword(s):  
Complete Graph ◽  
Tensor Products ◽  
Coloring Problem ◽  
Map Coloring

The genus parameter for graphs has been studied extensively in recent years, with impetus given primarily by the Ringel-Youngs solution to the Heawood Map-coloring Problem [15]. This solution involved the determination of 𝛄(Kn), the genus of the complete graph Kn.

scholarly journals Solution of the heawood map-coloring problem—Case 2

1969 ◽  
Vol 7 (4) ◽  
pp. 342-352 ◽  
Author(s):  
Gerhard Ringel ◽  
J.W.T. Youngs
Keyword(s):  
Coloring Problem ◽  
Problem Case ◽  
Map Coloring

An Algorithm for Map Coloring Problem Based on Depth First Search

2012 ◽  
Vol 424-425 ◽  
pp. 480-483
Author(s):  
Fan Gao ◽  
Xiao Zheng Mai ◽  
Bing Liang Cui
Keyword(s):  
Search Algorithm ◽  
Optimal Solutions ◽  
Depth First Search ◽  
Coloring Problem ◽  
Map Coloring

From analyzing the characters of depth first search algorithm， we proposed a new map coloring algorithm. The proposed algorithm overcomes the disadvantage of other algorithms in the field of Map-coloring, and the results show that the proposed algorithms can solve the problem of coloring administrative map efficiently and obtain optimal solutions

scholarly journals SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

1968 ◽  
Vol 60 (2) ◽  
pp. 438-445 ◽  
Author(s):  
G. Ringel ◽  
J. W. T. Youngs
Keyword(s):  
Coloring Problem ◽  
Map Coloring
Sign in / Sign up

Export Citation Format

Share Document