Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes

Dreier, Jan; Mählmann, Nikolas; Toruńczyk, Szymon

by Jan Dreier, Nikolas Mählmann, Szymon Toruńczyk

Reference:

Flip-breakability: A combinatorial dichotomy for monadically dependent graph classesJan Dreier, Nikolas Mählmann, Szymon ToruńczykProceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), pages 1550–1560, 2024.

Bibtex Entry:

@inproceedings{dreier2024flipbreakability,
  title={Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes},
  author={Dreier, Jan and M{\"a}hlmann, Nikolas and Toru{\'n}czyk, Szymon},
  booktitle={Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC)},
  pages={1550--1560},
  year={2024},
  url={https://arxiv.org/pdf/2403.15201.pdf}
}