The following pages link to (Q3804190):
Displayed 6 items.
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- On the isomorphism of expressions (Q1583053) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)