A linear algorithm to color i-triangulated graphs
Information Processing Letters
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
| Hi-index | 0.00 |
We call a T-vertex of a graph G = (V, E) a vertex z whose neighbourhood N(z) in G induces a triangulated graph, and we show that every C4-free Berge graph either is a clique or contains at least two non-adjacent T-vertices. An easy consequence of this result is that every C4-free Berge graph admits a T-elimination scheme, i.e. an ordering [v1, v2, . . . , vn] of its vertices such that vi is a T-vertex in the subgraph induced by vi, . . . , vn in G.