On the structure of (P5, gem)-free graphs

@article{Brandstdt2005OnTS,
  title={On the structure of (P5, gem)-free graphs},
  author={Andreas Brandst{\"a}dt and Dieter Kratsch},
  journal={Discrete Applied Mathematics},
  year={2005},
  volume={145},
  pages={155-166}
}
We give a complete structure description of ( P5,gem)-free graphs. By the results of a related paper, this implies bounded clique width for this graph class. Hereby, as usual, the P5 is the induced path with five vertices a, b, c, d, e and four edges ab, bc, cd, de, and thegemconsists of aP4 a, b, c, d with edgesab, bc, cd plus a universal vertex eadjacent toa, b, c, d. © 2004 Elsevier B.V. All rights reserved. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Graph Classes: A Survey

  • A. Brandst adt, V. B. Le, J. Spinrad
  • SIAM Monographs on Discrete Math. Appl.,
  • 1999
1 Excerpt

Representation of finite graphs by a set of intervals on the real line

  • J. Ch. Boland Lekkerkerker
  • J . Graph Theory
  • 1989

Similar Papers

Loading similar papers…