The following pages link to (Q3795251):
Displaying 10 items.
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Recursively indefinite databases (Q688672) (← links)
- Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
- Algorithms for graph problems on BNLC structured garphs (Q1175948) (← links)
- A comparison of compatible, finite, and inductive graph properties (Q1812942) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- Yes, the “missing axiom” of matroid theory is lost forever (Q4642529) (← links)
- Hyperedge replacement with rendezvous (Q5044734) (← links)
- On matroids and hierarchical graphs (Q5056114) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
