On the two‐edge‐colorings of perfect graphs
Chı́nh T. Hoàng · Journal of Graph Theory · 1995
Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a P4 (chordless path with four vertices). Partial results on this conjecture are given in this paper. © 1995 John Wiley & Sons, Inc.