Vertex and edge colorings
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
Discussed mainly in this paper are proper vertex and edge colorings of graphs. A proper vertex coloring of a graph G is an assignment of colors to the vertices of G. One color to each vertex, so that adjacent vertices are assigned different colors. Similarly, a proper edge coloring is an assignment of colors edges of G so that adjacent edges are assigned different colors. In addition, examples of applications of proper coloring of a graph in solving practical mathematical problems are provided. There is a computer program that implements two of such applications, one for each type of coloring.
Abstract Format
html
Language
English
Format
Accession Number
TU07064
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
55 numb. leaves
Keywords
Graph theory; Colors; Four-color problem; Programming (Mathematics)
Recommended Citation
Ramos, M. L., & Tan, R. C. (1995). Vertex and edge colorings. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16263
