14 citations · 19 across the 2 of their papers we have counts for
2 papers
math.CO2017★ 5 cited
On facial unique-maximum (edge-)coloring
Vesna Andova, Bernard Lidický, Borut Lužar +1
A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face the maximal color appears exactly once on the vertices of . If the coloring is requ…
math.CO2014★ 14 cited
Sandwiching saturation number of fullerene graphs
Vesna Andova, František Kardoš, Riste Škrekovski
The saturation number of a graph is the cardinality of any smallest maximal matching of , and it is denoted by . Fullerene graphs are cubic planar graphs with exactly…