Pages that link to "Item:Q5149166"
From MaRDI portal
The following pages link to Clique-width for hereditary graph classes (Q5149166):
Displayed 22 items.
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw (Q2045400) (← links)
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width (Q2121810) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- A class of graphs with large rankwidth (Q6080165) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)