On the coloring of empire maps
Date of Publication
1995
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
To achieve a general solution to the problem of map coloring, empire maps are considered. Since previous studies on map coloring only made use of the four-color theorem, the results discussed in this paper also serve to generalize this famous theorem.Empire maps are defined as maps having sets of different empires, where each empire can consist of several regions. Moreover, M-pire maps are empire maps in which each empire is composed of at most M regions.To solve the problem of empire map coloring, the notion of an M-pire graph is introduced and well-known results from graph theory are used.The general solution proven by Heawood, and which was further justified by Jackson and Ringel, is discussed in detail. A computer program illustrating the algorithm for empire map coloring based on the theorem of Heawood is also presented.
Abstract Format
html
Language
English
Format
Accession Number
TU07037
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
87 leaves
Keywords
Mappings (Mathematics); Graph theory; Programming (Mathematics); Map-coloring problem
Recommended Citation
Ang, J. L., & Uy, J. L. (1995). On the coloring of empire maps. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16237
