✦ LIBER ✦

On α-redundant vertices in P5-free graphs

✍ Scribed by Andreas Brandstädt; Hoàng-Oanh Le; Van Bang Le

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 73 KB
Volume: 82
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00265-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weighted parameters in (P5, P5)-free gra

Weighted parameters in (P5, P5)-free graphs

✍ Vassilis Giakoumakis; Irena Rusu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 488 KB

We use the modular decomposition to give O(n(m + n)) algorithms for finding a maximum weighted clique (respectively stable set) and an approximate weighted colouring (respectively partition into cliques) in a (&,E)-free graph. As a by-product, we obtain an O(m+n) algorithm for finding a minimum weig

Dominating cliques in P5-free graphs

✍ G. Bacsó; Zs. Tuza 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 372 KB

On eccentric vertices in graphs

✍ Chartrand, Gary; Schultz, Michelle; Winters, Steven J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB

The eccentricity e(u) of a vertex u in a connected graph G is the distance between u and a vertex furthest from u. The minimum eccentricity among the vertices of G is the radius rad G of G, and the maximum The radial number m(u) of u is the minimum eccentricity among the eccentric vertices of u, wh

Some results on maximum stable sets in c

Some results on maximum stable sets in certain P5-free graphs

✍ Raffaele Mosca 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 149 KB

On-line graph coloring of({mathbb{P}_5})

On-line graph coloring of({mathbb{P}_5})-free graphs

✍ Iwona Cieślik 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 381 KB

Embedding longest fault-free paths in ar

Embedding longest fault-free paths in arrangement graphs with faulty vertices

✍ Ray-Shang Lo; Gen-Huey Chen 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB 👁 1 views