Tight bounds for counting colorings and connected edge sets parameterized by cutwidth

DOI10.4230/LIPICS.STACS.2022.36MaRDI QIDQ6490982FDOQ6490982

Authors: Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi 

Publication date: 23 April 2024

zbMATH Keywords

coloringsparameterized algorithmscutwidthconnected edge setscounting modulo \(p\)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Tight bounds for counting colorings and connected edge sets parameterized by cutwidth

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