GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
From MaRDI portal
Publication:5696971
DOI10.1142/S0129054104002364zbMath1101.68719MaRDI QIDQ5696971
Hoàng-Oanh Le, Andreas Brandstädt, Raffaele Mosca
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (23)
List coloring in the absence of two subgraphs ⋮ A local characterization of bounded clique-width for line graphs ⋮ Colouring diamond-free graphs ⋮ Bounding the Clique-Width of H-free Chordal Graphs ⋮ Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs ⋮ Colouring of graphs with Ramsey-type forbidden subgraphs ⋮ Bounding the mim‐width of hereditary graph classes ⋮ Clique‐width: Harnessing the power of atoms ⋮ Bounding clique-width via perfect graphs ⋮ Polynomial-time recognition of clique-width \(\leq 3\) graphs ⋮ Clique-Width for Graph Classes Closed under Complementation ⋮ Classifying the clique-width of \(H\)-free bipartite graphs ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ Bounding the Mim-Width of Hereditary Graph Classes. ⋮ On minimal prime extensions of a four-vertex graph in a prime graph ⋮ Well-quasi-ordering versus clique-width: new results on bigenic classes ⋮ Clique-width of graphs defined by one-vertex extensions ⋮ The stable set polytope for some extensions of \(P_4\)-free graphs ⋮ Bounding Clique-Width via Perfect Graphs ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Unnamed Item ⋮ Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes ⋮ Optimal centrality computations within bounded clique-width graphs
Cites Work
- Strong tree-cographs are Birkhoff graphs
- Complement reducible graphs
- Modular decomposition and transitive orientation
- On the \(p\)-connectedness of graphs---a survey
- \(k\)-NLC graphs and polynomial algorithms
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- A characterization of graphs without long induced paths
- A Linear Recognition Algorithm for Cographs
- Some classes of perfectly orderable graphs
- Graph Classes: A Survey
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
This page was built for publication: GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH