Skip to content

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems.

Johanna Brunar, Marcin Kozik, Toms Nagy, Michael Pinsker

VenueA*LICS
Year2025
ProceedingsLICS

Browse the full LICS paper archive.