The following pages link to (Q4037313):
Displaying 10 items.
- Tree-depth and vertex-minors (Q281932) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Polynomial graph invariants from homomorphism numbers (Q906477) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
