Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Graph classes: a survey
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Efficient and practical algorithms for sequential modular decomposition
Journal of Algorithms
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Some results on maximum stable sets in certain P5-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Theoretical Computer Science
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
Hi-index | 0.00 |
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 the gem consists of a P4 a, b, c, d with edges ab, bc, cd plus a universal vertex e adjacent to a, b, c, d.