Recognition algorithm for diamond-free graphs

Informatica

Volumn 18, Issue 3, 2007, Pages 457-462

  Talmaciu, Mihai ^a   Nechita, Elena ^a  

^a VASILE ALECSANDRI UNIVERSITY OF BACAU   (Romania)

Author keywords

Diamond graph; Recognition algorithm; Weakly decomposition

Indexed keywords

EID: 34848854750     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. Berge, C. (1985). Graphs. Nort-Holland, Amsterdam.
2. 5, diamond)-free graphs revited: structure and linear time optimization. Discrete Applied Math., 138, 13-27.
3. Brandstadt, A., T.C. Hoang and J.-M. Vanherpe (2002). On minimal prime extensions of a four-vertex graph in a prime graph. Manuscript.
4. Brandstadt, A., H.-O. Le, V.V. Lozin (2003). New graph classes of bounded clique-width II. Rutcor Research Report 34-2003.
5. Croitoru, C., and M.Talmaciu (2000). A new graph search algorithm, and some applications. Presented at ROSYCS 2000, Univ. Al.I.Cuza Iagi.
6. Kloks, T., D. Kratsch and H. Muller. Finding and counting small induced subgraphs efficiently. Manuscript.
7. Talmaciu, M. (2002). Decomposition Problems in the Graph Theory with Applications in Combinatorial Optimization. Ph. D. University Al. I. Cuza Iasi, Romania.