Wing-triangulated graphs are perfect
Stefan Hougardy, Van Bang Lê, Annegret K. Wagler · Journal of Graph Theory · 1997
The wing-graph W(G) of a graph G has all edges of G as its vertices; two edges of G are adjacent in W(G) if they are the nonincident edges (called wings) of an induced path on four vertices in G. Hoàng conjectured that if W(G) has no induced cycle of odd length at least five, then G is perfect. As a partial result towards Hoàng's conjecture we prove that if W(G) is triangulated, then G is perfect. © 1997 John Wiley & Sons, Inc.