On Weakly Triangulated Graphs
A. Hilali · 2013
A graph is weakly triangulated if neither the graph nor its complement contains a chordless cycle on five or more vertices. It is known that a graph is weakly triangulated if and only if it admits a co-pair elimination ordering on the edges. We show that for every vertex in a weakly triangulated graph there exist a co-pair elimination ordering on the edges that ends by edges at this vertex.