On variations of P₄-sparse graphs
From MaRDI portal
Publication:1406046
Recommendations
- On extended P₄-reducible and extended P₄-sparse graphs
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- A tree representation for \(P_ 4\)-sparse graphs
- Recognizing $P_4 $-Sparse Graphs in Linear Time
Cites work
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 1262783 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A nice class for the vertex packing problem
- A tree representation for \(P_ 4\)-sparse graphs
- Complement reducible graphs
- Difference graphs
- Efficient and practical algorithms for sequential modular decomposition
- Graph Classes: A Survey
- Handle-rewriting hypergraph grammars
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Modular decomposition and transitive orientation
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
- On the \(p\)-connectedness of graphs---a survey
- On the clique-width of graph with few \(P_{4}\)'s
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- Some classes of perfectly orderable graphs
- Stability number of bull- and chair-free graphs revisited
- The Complexity of the Partial Order Dimension Problem
- Upper bounds to the clique width of graphs
Cited in
(17)- Classifying the clique-width of \(H\)-free bipartite graphs
- scientific article; zbMATH DE number 2096434 (Why is no real title available?)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- On the minimum sum coloring of \(P_4\)-sparse graphs
- Minimal separators in \(P_4\)-sparse graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Bounding clique-width via perfect graphs
- On quasi-monotonous graphs
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Bounding clique-width via perfect graphs
- Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs
- The stable set polytope for some extensions of \(P_4\)-free graphs
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
- Bounding the clique-width of \(H\)-free split graphs
This page was built for publication: On variations of \(P_{4}\)-sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406046)
