Deepanshu Kush, Benjamin Rossman. Tree-Depth and the Formula Complexity of Subgraph Isomorphism. SIAM Journal on Computing, 52(1):273-325, February 2023. [doi]
@article{KushR23,
title = {Tree-Depth and the Formula Complexity of Subgraph Isomorphism},
author = {Deepanshu Kush and Benjamin Rossman},
year = {2023},
month = {February},
doi = {10.1137/20m1372925},
url = {https://doi.org/10.1137/20m1372925},
researchr = {https://researchr.org/publication/KushR23},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {52},
number = {1},
pages = {273-325},
}