On (P5, diamond)-free graphs

Authors:
Claudio Arbib;Raffaele Mosca
Affiliations:
Dipartimento di Matematica Pura ed Applicate, Universita degli studi di L'Aquila, via Vetoio, 1-67010 Coppito, L'Aquila, Italy;Dipartimento di Matematica Pura ed Applicate, Universita degli studi di L'Aquila, via Vetoio, 1-67010 Coppito, L'Aquila, Italy
Venue:
Discrete Mathematics
Year:
2002

Citing 9
Cited 10

Graphs with no induced C4 and 2K2

Discrete Mathematics
Stability number of bull- and chair-free graphs

Discrete Applied Mathematics
On graphs without P5 and P¯5

Discrete Mathematics
The rank facets of the stable set polytope for claw-free graphs

Journal of Combinatorial Theory Series B
Weighted parameters in (P5,&Pmacr;5)-free graphs

Discrete Applied Mathematics
Coloring graphs with no odd-K4

Discrete Mathematics
Polyhedral characterizations and perfection of line graphs

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Irredundance perfect and P6-free graphs

Journal of Graph Theory

On easy and hard hereditary classes of graphs with respect to the independent set problem

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On the structure and stability number of P5- and co-chair-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Some results on maximum stable sets in certain P5-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
(P5,diamond)-free graphs revisited: structure and linear time optimization

Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
New applications of clique separator decomposition for the Maximum Weight Stable Set problem

Theoretical Computer Science
Maximum independent sets in subclasses of P5-free graphs

Information Processing Letters
Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
First-Fit coloring of {P5,K4-e}-free graphs

Discrete Applied Mathematics
New applications of clique separator decomposition for the maximum weight stable set problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.05

Visualization

Abstract

We study the stability number, chromatic number and clique cover of graphs with no induced P5 and diamonds. In particular, we provide a way to obtain all imperfect (P5, diamond)-free graphs by iterated point multiplication or substitution from a finite collection of small basic graphs. Corollaries of this and other structural properties, among which a result of Bacsó and Tuza, are (i) combinatorial algorithms to solve coloring, clique cover and stable set in the class of (P5, diamond)-free graphs, (ii) a complete description of the stable set polytope of (P5, diamond)-free graphs, and (iii) the existence of non-trivial h-perfect graphs which are not t-perfect.