Andreas Krebs, Oleg Verbitsky. Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. pages 689-700, IEEE, 2015. [doi]
@inproceedings{KrebsV15,
title = {Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth},
author = {Andreas Krebs and Oleg Verbitsky},
year = {2015},
doi = {10.1109/LICS.2015.69},
url = {http://dx.doi.org/10.1109/LICS.2015.69},
researchr = {https://researchr.org/publication/KrebsV15},
cites = {0},
citedby = {0},
pages = {689-700},
booktitle = {30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015},
publisher = {IEEE},
isbn = {978-1-4799-8875-4},
}