81 citations · 214 across the 80 of their papers we have counts for
5 papers · 1 filter
Packing chromatic number under local changes in a graph
Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1
The packing chromatic number of a graph is the smallest integer such that there exists a -vertex coloring of in which any two vertices receiving color a…
Packing chromatic number, -colorings, and characterizing the Petersen graph
Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1
The packing chromatic number of a graph is the smallest integer such that the vertex set of can be partitioned into sets , where , $i\in […
Trees with distinguishing index equal distinguishing number plus one
Saeid Alikhani, Sandi Klavžar, Florian Lehner +1
The distinguishing number (index) () of a graph is the least integer such that has an vertex (edge) labeling with labels that is preserved only by the…
Dominating sequences in grid-like and toroidal graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5
A longest sequence of distinct vertices of a graph such that each vertex of dominates some vertex that is not dominated by its preceding vertices, is called a Grundy do…
(Total) Domination in Prisms
Jernej Azarija, Michael A. Henning, Sandi Klavžar
With the aid of hypergraph transversals it is proved that , where and denote the total domination number and the domination number of , r…