A new graph construction of unbounded clique-width
From MaRDI portal
Publication:509276
DOI10.1016/J.ENDM.2016.11.005zbMATH Open1355.05188OpenAlexW2559266576MaRDI QIDQ509276FDOQ509276
Authors: Nicholas Korpelainen 
Publication date: 9 February 2017
Full work available at URL: https://doi.org/10.1016/j.endm.2016.11.005
Recommendations
- scientific article; zbMATH DE number 2191997
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Between clique-width and linear clique-width of bipartite graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Structural characterization of families of graphs (05C75)
Cites Work
- 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
- 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
- Title not available (Why is that?)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Title not available (Why is that?)
- Bipartite graphs of large clique-width
- The tree- and clique-width of bipartite graphs in special classes
Cited In (8)
- Critical properties of bipartite permutation graphs
- Bipartite graphs of large clique-width
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width
- MSO undecidability for hereditary classes of unbounded clique-width
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A new graph construction of unbounded clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509276)
