Pages that link to "Item:Q998353"
From MaRDI portal
The following pages link to Clique-width of graphs defined by one-vertex extensions (Q998353):
Displaying 19 items.
- Neighbourhood-width of trees (Q501055) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Directed NLC-width (Q906393) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
- Scattered Classes of Graphs (Q4959761) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5089217) (← links)
- (Q5090996) (← links)
- A Random Permutation Model Arising in Chemistry (Q5504161) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)