The following pages link to (Q4273871):
Displaying 11 items.
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Treewidth and logical definability of graph products (Q1006041) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
- \(K_4\)-free graphs as a free algebra (Q5111293) (← links)
- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices (Q5387751) (← links)