Pages that link to "Item:Q5919541"
From MaRDI portal
The following pages link to The descriptive complexity of subgraph isomorphism without numerics (Q5919541):
Displayed 8 items.
- First-order complexity of subgraph isomorphism via Kneser graphs (Q2037624) (← links)
- First-order definitions of subgraph isomorphism through the adjacency and order relations (Q2211263) (← links)
- MSO 0-1 law for recursive random trees (Q2244503) (← links)
- (Q3121527) (← links)
- Short Monadic Second Order Sentences about Sparse Random Graphs (Q4562315) (← links)
- Logical complexity of induced subgraph isomorphism for certain families of graphs (Q5003303) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
- Item:Q5919541 (redirect page) (← links)