The following pages link to (Q4694744):
Displayed 4 items.
- Algorithms for graph problems on BNLC structured garphs (Q1175948) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)