Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma. 2)-Free Graphs: An Almost Complete Dichotomy. In Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour, editors, Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings. Volume 11646 of Lecture Notes in Computer Science, pages 181-195, Springer, 2019. [doi]
@inproceedings{BonamyD0P19,
title = {2)-Free Graphs: An Almost Complete Dichotomy},
author = {Marthe Bonamy and Konrad K. Dabrowski and Matthew Johnson 0002 and Daniël Paulusma},
year = {2019},
doi = {10.1007/978-3-030-24766-9_14},
url = {https://doi.org/10.1007/978-3-030-24766-9_14},
researchr = {https://researchr.org/publication/BonamyD0P19},
cites = {0},
citedby = {0},
pages = {181-195},
booktitle = {Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
editor = {Zachary Friggstad and Jörg-Rüdiger Sack and Mohammad R. Salavatipour},
volume = {11646},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-24766-9},
}