Channel allocation revisited through 1-extendability of graphs

DOI10.1016/J.TCS.2025.115436MaRDI QIDQ6930235zbMATH OpenFDO

Authors Anthony Busson, Malory Marin, Rémi Watrigant

Publication date 16 September 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph coloringchannel allocation1-extendability

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15) Network protocols (68M12)

This page was built for publication: Channel allocation revisited through 1-extendability of graphs

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