✦ LIBER ✦

P4-laden graphs: A new class of brittle graphs

✍ Scribed by Vassilis Giakoumakis

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 739 KB
Volume: 60
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(96)00134-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quasi-brittle graphs, a new class of per

Quasi-brittle graphs, a new class of perfectly orderable graphs

✍ Stephan Olariu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 893 KB

A graph G is quasi-brittle if every induced subgraph H of G contains a vertex which is incident to no edge extending symmetrically to a chordless path with three edges in either H or its complement 8. The quasi-britiie graphs turn out to be a natural generalization of the well-known class of brittle

Skeletal graphs — a new class of perfect

Skeletal graphs — a new class of perfect graphs

✍ A. Hertz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Let S be an arbitrary collection of stars in a graph G such that there is no chain of length ~3 joining the centers of (any) two stars in G. We consider the graphs that can be obtained by deleting in a parity graph all the edges of such a set S. These graphs will be called skeletal graphs and we pro

A new class of perfect Hoàng graphs

✍ Irena Rusu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Asymptotic solution for a new class of f

Asymptotic solution for a new class of forbiddenr-graphs

✍ A. F. Sidorenko 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 446 KB

The n-ordered graphs: A new graph class

✍ Anthony Bonato; Jeannette Janssen; Changping Wang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

## Abstract For a positive integer __n__, we introduce the new graph class of __n__‐ordered graphs, which generalize partial __n__‐trees. Several characterizations are given for the finite __n__‐ordered graphs, including one via a combinatorial game. We introduce new countably infinite graphs __R__

A decomposition for a class of (P5,P̄5)-

A decomposition for a class of (P5,P̄5)-free graphs

✍ J.L. Fouquet 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Fouquet, J.L., A decomposition for a class of (P,, P,)-free graphs, Discrete Mathematics 121 (1993) 75-83. We give a decomposition for a subclass of (P5, P, )-free graphs, leading to an 0(n3) algorithm for the recognition of this class of graphs.