Forbidden Substructures in Graphs and Trigraphs, and Related Coloring Problems
Given a graph G, χ(G) denotes the chromatic number of G, and ω(G) denotes the clique number of G (i.e. the maximum number of pairwise adjacent vertices in G). A graph G is perfect provided that for every induced subgraph H of G, χ(H) = ω(H). This thesis addresses several problems from the theory of...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://doi.org/10.7916/D89Z9BZK |