Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds

MaRDI QIDQ7215558arXivFDO

Authors Sujoy Bhore, Fionn Mc Inerney

Publication date 2026

Published in arXiv

arXiv classification

cs.CC

This page was built for publication: Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7215558)