11 citations · 27 across the 12 of their papers we have counts for
3 papers · 1 filter
Packing coloring of hypercubes with extended Hamming codes
Petr Gregor, Jaka Kranjc, Borut Lužar +1
A {\em packing coloring} of a graph is a mapping assigning a positive integer (a color) to every vertex of such that every two vertices of color are at distance at leas…
Twin-width of graphs on surfaces
Daniel Kráľ, Kristýna Pekárková, Kenny Štorgel
Twin-width is a width parameter introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20, JACM'22], which has many structural and algorithmic applications. We prove that the twin…
Functionality of box intersection graphs
Clément Dallard, Vadim Lozin, Martin Milanič +2
Functionality is a graph complexity measure that extends a variety of parameters, such as vertex degree, degeneracy, clique-width, or twin-width. In the present paper, we show that…