(2019). On the First-Order Complexity of Induced Subgraph Isomorphism. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"On the First-Order Complexity of Induced Subgraph Isomorphism."
Logical Methods in Computer Science 2019.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"On the First-Order Complexity of Induced Subgraph Isomorphism."
Logical Methods in Computer Science, 2019.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.