A new graph construction of unbounded clique-width
From MaRDI portal
Publication:509276
DOI10.1016/j.endm.2016.11.005zbMath1355.05188OpenAlexW2559266576MaRDI QIDQ509276
Publication date: 9 February 2017
Full work available at URL: https://doi.org/10.1016/j.endm.2016.11.005
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal classes of graphs of unbounded clique-width
- Graph minors. V. Excluding a planar graph
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Bipartite Graphs of Large Clique-Width