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: | Ramos, Ma. Jasmin L., Tan, Richard C. |
---|---|
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 |
Similar Items
-
On the coloring of empire maps
by: Ang, Jorge L., et al.
Published: (1995) -
Colorability of glued graphs
by: Chanon Promsakon
Published: (2011) -
On the game chromatic number of Cartesian product of graphs
by: Encinas, Sarah Jane K., et al.
Published: (2010) -
On twin edge colorings in m-ary trees
by: Tolentino, Jayson D, et al.
Published: (2022) -
Sigma Coloring and Edge Deletions
by: Garciano, Agnes, et al.
Published: (2020)