Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes

MaRDI QIDQ6512095arXivFDO

Authors Édouard Bonnet, Julien Duron, John Sylvester, Victor Zamaraev, M. E. Zhukovskii

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorics in computer science (68R05) General topics of discrete mathematics in relation to computer science (68R01)

This page was built for publication: Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes

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