Pages that link to "Item:Q519907"
From MaRDI portal
The following pages link to The behavior of clique-width under graph operations and graph transformations (Q519907):
Displaying 17 items.
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Induced betweenness in order-theoretic trees (Q5038203) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- Bounds on the Twin-Width of Product Graphs (Q6131799) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
