First-order definitions of subgraph isomorphism through the adjacency and order relations
From MaRDI portal
(Redirected from Publication:2211263)
Recommendations
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- A short tutorial on order-invariant first-order logic
- Color-coding
- On the first-order complexity of induced subgraph isomorphism
- Powers of tensors and fast matrix multiplication
- Tight bounds on the asymptotic descriptive complexity of subgraph isomorphism
Cited in
(6)- On the first-order complexity of induced subgraph isomorphism
- First-order complexity of subgraph isomorphism via Kneser graphs
- On first-order definitions of subgraph isomorphism properties
- The first order definability of graphs: Upper bounds for quantifier depth
- On the first-order complexity of induced subgraph isomorphism
- Logical complexity of induced subgraph isomorphism for certain families of graphs
This page was built for publication: First-order definitions of subgraph isomorphism through the adjacency and order relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211263)