Boštjan Brešar

most citedPacking chromatic number,

(1, 1, 2, 2)

-colorings, and characterizing the Petersen graph

3 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.CO2016

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 $G$ with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was…

math.CO2016★ 1 cited

Packing chromatic number under local changes in a graph

Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $k$ such that there exists a $k$ -vertex coloring of $G$ in which any two vertices receiving color $i$ a…

math.CO2016★ 3 cited

Packing chromatic number, $(1, 1, 2, 2)$ -colorings, and characterizing the Petersen graph

Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $Π_{1}, \dots, Π_{k}$ , where $Π_{i}$ , $i\in […

Total dominating sequences in trees, split graphs, and under modular decomposition

Packing chromatic number under local changes in a graph

Packing chromatic number, (1,1,2,2)-colorings, and characterizing the Petersen graph

Packing chromatic number, $(1, 1, 2, 2)$ -colorings, and characterizing the Petersen graph