Discrete Applied Mathematics - Combinatorial Optimization
Recognizing P4-sparse graphs in linear time
SIAM Journal on Computing
A tree representation for P4-sparse graphs
Discrete Applied Mathematics
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Linear time optimization for P 4-sparse graphs
Discrete Applied Mathematics
Proceedings of an international symposium on Graphs and combinatorics
On extendedP4-reducible and extendedP4-sparse graphs
Theoretical Computer Science
A nice class for the vertex packing problem
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Graph classes: a survey
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Efficient and practical algorithms for sequential modular decomposition
Journal of Algorithms
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
Clique-width for four-vertex forbidden subgraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem
Theoretical Computer Science
| Hi-index | 0.05 |
Hoàng defined the P4-sparse graphs as the graphs where every set of five vertices induces at most one P4. These graphs attracted considerable attention in connection with the P4-structure of graphs and the fact that P4-sparse graphs have bounded clique-width. Fouquet and Giakoumakis generalized this class to the nicely structured semi-P4-sparse graphs being the (P5, co-P5, co-chair)-free graphs.We give a complete classification with respect to clique-width of all superclasses of P4-sparse graphs defined by forbidden P4 extensions by one vertex which are not P4-sparse, ie. the P5, chair, P, C5 as well as their complements. It turns out that there are exactly two other inclusion-maximal classes defined by three or four forbidden P4 extensions namely the (P5, P, co-chair)-free graphs and the (P, co-P, chair, co-chair)-free graphs which also deserve the name semi-P4-sparse.