3 citations · 4 across the 4 of their papers we have counts for
4 papers · 1 filter
On the chromatic edge stability index of graphs
Saieed Akbari, Arash Beikmohammadi, Boštjan Brešar +3
Given a non-trivial graph , the minimum cardinality of a set of edges in such that is called the chromatic edge stability index of , denoted…
Total dominating sequences in trees, split graphs, and under modular decomposition
Boštjan Brešar, Tim Kos, Graciela Nasini +1
A sequence of vertices in a graph with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was…
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 […