Clique-width of graphs defined by one-vertex extensions
From MaRDI portal
Publication:998353
DOI10.1016/j.disc.2007.11.039zbMath1180.05081OpenAlexW2079306871MaRDI QIDQ998353
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.039
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (19)
Structural parameterizations of clique coloring ⋮ Solving problems on generalized convex graphs via mim-width ⋮ The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes ⋮ Steiner trees for hereditary graph classes: a treewidth perspective ⋮ Computing the largest bond and the maximum connected cut of a graph ⋮ Bounding the mim‐width of hereditary graph classes ⋮ Directed NLC-width ⋮ On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs ⋮ Solving problems on generalized convex graphs via mim-width ⋮ Neighbourhood-width of trees ⋮ Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ Bounding the Mim-Width of Hereditary Graph Classes. ⋮ Unnamed Item ⋮ Boolean-width of graphs ⋮ Unnamed Item ⋮ Scattered Classes of Graphs ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ A Random Permutation Model Arising in Chemistry ⋮ Optimal centrality computations within bounded clique-width graphs
Cites Work
- Unnamed Item
- Characterizations for restricted graphs of NLC-width 2
- Completely separable graphs
- Distance-hereditary graphs
- Complement reducible graphs
- \(k\)-NLC graphs and polynomial algorithms
- Graphs indecomposable with respect to the X-join
- Handle-rewriting hypergraph grammars
- Approximating clique-width and branch-width
- The bi-join decomposition
- Graph minors. II. Algorithmic aspects of tree-width
- Decomposition of Directed Graphs
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Transitiv orientierbare Graphen
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
This page was built for publication: Clique-width of graphs defined by one-vertex extensions