𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On theP4-Structure of Perfect Graphs V. Overlap Graphs

✍ Scribed by Chı́nh T. Hoàng; Stefan Hougardy; Frédéric Maffray

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
480 KB
Volume
67
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

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 perfect.

📜 SIMILAR VOLUMES

A characterization of domination perfect
A characterization of domination perfect graphs
✍ I. E. Zverovich; V. E. Zverovich 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

Let u(G) and i(G) be the domination number and independent domination number of a graph G. respectively. Sumner and Moore [8] define a graph G to be domination perfect if y( H) = i( H), for every induced subgraph H of G. In this article, we give a finite forbidden induced subgraph characterization o

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

Proof of a conjecture on irredundance pe
Proof of a conjecture on irredundance perfect graphs
✍ Lutz Volkmann; Vadim E. Zverovich 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

## Abstract Let __ir__(__G__) and γ(__G__) be the irredundance number and the domination number of a graph __G__, respectively. A graph __G__ is called __irredundance perfect__ if __ir__(__H__)=γ(__H__), for every induced subgraph __H__ of __G__. In this article we present a result which immediatel

On the perfect orderability of unions of
On the perfect orderability of unions of two graphs
✍ Ho�ng, Ch�nh T.; Tu, Xiaodan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB 👁 3 views

A graph G is perfectly orderable, if it admits an order < on its vertices such that the sequential coloring algorithm delivers an optimum coloring on each induced subgraph (H, <) of (G, <). A graph is a threshold graph, if it contains no P 4 , 2K 2 , and C 4 as induced subgraph. A theorem of Chvátal

A note on the characterization of domina
A note on the characterization of domination perfect graphs
✍ Jason Fulman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, γ(__H__) = __i__(__H__), where γ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of

On the structure of hereditary classes o
On the structure of hereditary classes of graphs
✍ Edward R. Scheinerman 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views

A class of graphs is hereditary if it is closed under taking induced subgraphs. Classes associated with graph representations have "composition sequences" and we show that this concept is equivalent to a notion of "amalgamation" which generalizes disjoint union of graphs. We also discuss how general