Vertex and edge colorings
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1995
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16263 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| 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. |
|---|