Premium
Wing‐triangulated graphs are perfect
Author(s) -
Hougardy Stefan,
Le Van Bang,
Wagler Annegret
Publication year - 1997
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199701)24:1<25::aid-jgt4>3.0.co;2-l
Subject(s) - mathematics , combinatorics , wing , physics , thermodynamics
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.