𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the P4-structure of Perfect Graphs. IV. Partner graphs

✍ Scribed by Ryan B Hayward; William J Lenhart

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
318 KB
Volume
48
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On theP4-Structure of Perfect Graphs V.
On theP4-Structure of Perfect Graphs V. Overlap Graphs
✍ ChΔ±́nh T. HoΓ ng; Stefan Hougardy; FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 480 KB

Given a graph G we define its k-overlap graph as the graph whose vertices are the induced P 4 's of G and two vertices in the overlap graph are adjacent if the corresponding P 4 's in G have exactly k vertices in common. For k=1, 2, 3 we prove that if the k-overlap graph of G is bipartite then G is

On the two-edge-colorings of perfect gra
On the two-edge-colorings of perfect graphs
✍ ChΓ­nh T. HoΓ ng πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 409 KB πŸ‘ 1 views

## 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 __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. Β© 1995 Joh