Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
From MaRDI portal
Publication:6512095
arXiv2307.11225MaRDI QIDQ6512095FDOQ6512095
Édouard Bonnet, John Sylvester, M. E. Zhukovskii, Julien Duron, Victor Zamaraev
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)
