Pages that link to "Item:Q2978187"
From MaRDI portal
The following pages link to Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187):
Displaying 15 items.
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- The micro-world of cographs (Q831855) (← links)
- A local characterization of bounded clique-width for line graphs (Q868337) (← links)
- Clique-width and the speed of hereditary properties (Q1010945) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Infinitely many minimal classes of graphs of unbounded clique-width (Q2413975) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- The Micro-world of Cographs (Q5041177) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width (Q6069433) (← links)
- Graphs of linear growth have bounded treewidth (Q6115513) (← links)
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024 (Q6613409) (← links)
