Linear Clique‐Width for Hereditary Classes of Cographs
From MaRDI portal
Publication:2978187
DOI10.1002/jgt.22037zbMath1359.05090arXiv1305.0636MaRDI QIDQ2978187
Nicholas Korpelainen, Robert Brignall, Vincent R. Vatter
Publication date: 21 April 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.0636
05A15: Exact enumeration problems, generating functions
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Tree Pivot-Minors and Linear Rank-Width, The Micro-world of Cographs, A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width, Clique-width with an inactive label, The micro-world of cographs, Critical properties and complexity measures of read-once Boolean functions, Between clique-width and linear clique-width of bipartite graphs, Infinitely many minimal classes of graphs of unbounded clique-width
Cites Work
- Minimal classes of graphs of unbounded clique-width
- Boolean-width of graphs
- Graphs of linear clique-width at most 3
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Recent developments on graphs of bounded clique-width
- \(k\)-NLC graphs and polynomial algorithms
- Edge dominating set and colorings on graphs with fixed clique-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- Approximating clique-width and branch-width
- The theory of well-quasi-ordering: a frequently discovered concept
- On the relationship between NLC-width and linear NLC-width
- Subclasses of the separable permutations
- A Complete Characterisation of the Linear Clique-Width of Path Powers
- Graph Classes: A Survey
- On the Relationship Between Clique-Width and Treewidth
- Induced subgraphs and well‐quasi‐ordering
- Sur l'extension aux relations de quelques propriétés des ordres
