The following pages link to (Q4037299):
Displaying 16 items.
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- On the reduction of Yutsis graphs (Q878649) (← links)
- A new reduction rule for the connection graph proof procedure (Q1114445) (← links)
- An algorithm for transitive reduction of an acyclic graph (Q1124350) (← links)
- The reduction of graph families closed under contraction (Q1126283) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- A method of graph reduction and its applications (Q1669583) (← links)
- (Q3320341) (← links)
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants (Q3507454) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- (Q4025927) (← links)
- An algebraic theory of graph reduction (Q4285634) (← links)
- (Q4691781) (← links)
- Canonical representations of partial 2-and 3-trees (Q5056113) (← links)
- Recognizable sets of graphs of bounded tree-width (Q5096279) (← links)
- Two strikes against perfect phylogeny (Q5204323) (← links)