The Descriptive Complexity of Subgraph Isomorphism Without Numerics
Research article (Theory of Computing Systems, 2018) · cited 11× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ The Descriptive Complexity of Subgraph Isomorphism Without Numerics — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 Cite this page
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA
4ort.xyz Knowledge Graph. (2026). The Descriptive Complexity of Subgraph Isomorphism Without Numerics. Retrieved May 24, 2026, from https://4ort.xyz/entity/the-descriptive-complexity-of-subgraph-isomorphism-without-numerics
MLA
“The Descriptive Complexity of Subgraph Isomorphism Without Numerics.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/the-descriptive-complexity-of-subgraph-isomorphism-without-numerics.
BibTeX
@misc{4ortxyz_the-descriptive-complexity-of-subgraph-isomorphism-without-numerics_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{The Descriptive Complexity of Subgraph Isomorphism Without Numerics}}, year = {2026}, url = {https://4ort.xyz/entity/the-descriptive-complexity-of-subgraph-isomorphism-without-numerics}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): The Descriptive Complexity of Subgraph Isomorphism Without Numerics — https://4ort.xyz/entity/the-descriptive-complexity-of-subgraph-isomorphism-without-numerics (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/the-descriptive-complexity-of-subgraph-isomorphism-without-numerics · Last refreshed: