Pages that link to "Item:Q967317"
From MaRDI portal
The following pages link to Recent developments on graphs of bounded clique-width (Q967317):
Displaying 27 items.
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- Clique-Width is NP-Complete (Q3563951) (← links)
- The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
- (Q4553282) (← links)
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree (Q4652630) (← links)
- The size‐Ramsey number of powers of bounded degree trees (Q5006327) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Partial complementation of graphs (Q5116485) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5890917) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← 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)
- Odd covers of graphs (Q6094037) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- On Structural Parameterizations of the Harmless Set Problem (Q6492087) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
- Algorithms for subgraph complementation to some classes of graphs (Q6663515) (← links)
