48 citations · 253 across the 49 of their papers we have counts for
4 papers · 1 filter
A counterexample to a conjecture on facial unique-maximal colorings
Bernard Lidický, Kacy Messerschmidt, Riste Škrekovski
A facial unique-maximum coloring of a plane graph is a proper vertex coloring by natural numbers where on each face the maximal color appears exactly once on the vertices of $α…
On the Clar Number of Benzenoid Graphs
Nino Bašić, István Estélyi, Riste Škrekovski +1
A Clar set of a benzenoid graph is a maximum set of independent alternating hexagons over all perfect matchings of . The Clar number of , denoted by , is the…
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…
On the minimum value of sum-Balaban index
Martin Knor, Jaka Kranjc, Riste Škrekovski +1
We consider extremal values of sum-Balaban index among graphs on vertices. We determine that the upper bound for the minimum value of the sum-Balaban index is at most …