Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes

Saved in:
Bibliographic Details
Published inProceedings of the 56th Annual ACM Symposium on Theory of Computing
Format Conference Proceeding
LanguageEnglish
Online AccessGet full text
DOI10.1145/3618260.3649739

Cover

More Information
DOI:10.1145/3618260.3649739