Perfect graphs
The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite perfect graphs. A graph G is perfect if G and each of its induced subgraphs have the property that the chromatic number is equal to the clique number. Specifically, it aimed to define a perfect graph,...
Saved in:
Main Author: | Lim, Yvette F. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1995
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/1780 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Perfection of glued graphs of perfect original graphs
by: Supaporn Saduakdee
Published: (2011) -
On Perfect Cayley Graphs
by: Garciano, Agnes, et al.
Published: (2002) -
Perfect quantum state transfer on Cayley graphs over semi-dihedral groups
by: Luo, Gaojun, et al.
Published: (2022) -
The bandwidth of the tower graph Tm,n
by: Lim, Yvette F., et al.
Published: (2009) -
The bandwidth of the tower graph Tm,2k
by: Lim, Yvette F., et al.
Published: (2008)