Pages that link to "Item:Q2496203"
From MaRDI portal
The following pages link to Approximating clique-width and branch-width (Q2496203):
Displayed 10 items.
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Monoidal Width: Capturing Rank Width (Q6150162) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- On structural parameterizations of load coloring (Q6184323) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- Locating Eigenvalues of Symmetric Matrices - A Survey (Q6198240) (← links)