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

Discrete Applied Mathematics

Volumn 145, Issue 2, 2005, Pages 155-166

  Brandstädt, Andreas ^a   Kratsch, Dieter ^b  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

(P5, gem) free graphs; Clique width; Modular decomposition; Modules and homogeneous sets in graphs; Prime graphs

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; SET THEORY; THEOREM PROVING;

(P5, GEM)-FREE GRAPHS; CLIQUE WIDTH; MODULAR DECOMPOSITION; MODULES AND HOMOGENEOUS SETS IN GRAPHS; PRIME GRAPHS;

GRAPH THEORY;

EID: 8344266770     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.01.009     Document Type: Article

References (17)

1. A. Brandstädt, H.-O. Le, R. Mosca, Chordal co-gem-free graphs have bounded clique width, Manuscript 2002.
2. A. Brandstädt, V.B. Le, J. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics Applied, vol. 3, SIAM, Philadelphia, 1999.
3. D.G. Cornell, H. Lerchs, L. Stewart-Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
4. D.G. Comeil, Y. Perl, L.K. Stewart, Cographs: recognition, applications, and algorithms, Congressus Numer. 43 (1984) 249-258.
5. D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926-934.
6. B. Courcelle, J. Engelfriet, G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. Syst. Sci. 46 (1993) 218-270.
7. B. Courcelle, J.A. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique width, Theory Comput. System 33 (2000) 125-150.
8. A. Cournier, M. Habib, A new linear algorithm for modular decomposition, LIRMM, University Montpellier (1995), Preliminary version in: Trees in Algebra and Programming - CAAP '94, Lecture Notes Comput. Sci. 787 (1994) 68-84.
9. E. Dahlhaus, J. Gustedt, R.M. McConnell, Efficient and practical algorithms for sequential modular decomposition, J. Algorithms 41 (2001) 360-387.
10. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
11. C.T. Hoàng, B. Reed, Some classes of perfectly orderafale graphs, J. Graph Theory 13 (1989) 445-463.
12. C.G. Lekkerkerker, J.Ch. Boland, Representation of finite graphs by a set of intervals on the real line, Fund. Math. 51 (1962) 45-64.
13. R.M. McConnell, J. Spinrad, Modular decomposition and transitive orientation, Discrete Math. 201 (1999) 189-241.
14. 5-free graphs, Discrete Appl. Math., 132(2003) 175-183.
15. D.J. Rose, R.E. Tarjan, G.S. Lueker; Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput. 5 (1976) 266-283.
16. R.E. Tarjan, M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984) 566-579 Addendum: SIAM J. Comput. 14 (1985) 254-255.
17. M. Yannakakis, The complexity of the partial order dimension problem, SIAM J. Algebra. Discrete Meth. 3 (1982) 351-358.