The following pages link to Vassilis Giakoumakis (Q412343):
Displaying 20 items.
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- All minimal prime extensions of hereditary classes of graphs (Q868943) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- Bi-complement reducible graphs (Q1356114) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- On the closure of graphs under substitution (Q1377871) (← links)
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285) (← links)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\) (Q1903716) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- (Q2816090) (← links)
- The set of prime extensions of a graph: the finite and the infinite case (Q3439148) (← links)
- (Q3788060) (← links)
- (Q3836509) (← links)
- BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION (Q5249025) (← links)
- LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P<sub>6</sub>-FREE GRAPHS (Q5696896) (← links)
