The following pages link to (Q5111290):
Displaying 12 items.
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Clique-width of countable graphs: A compactness property. (Q1422417) (← links)
- Computing the clique-width of cactus graphs (Q1744436) (← links)
- Treewidth versus clique number in graph classes with a forbidden structure (Q2110610) (← links)
- Subgraph complementation (Q2182091) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
- Partial complementation of graphs (Q5116485) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5915794) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Clique-width of point configurations (Q5918571) (← links)