B. Brešar

activity

20092026

most citedMinimum k-path vertex cover

167 citations · 213 across the 17 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Critical graphs for the chromatic edge-stability number

Boštjan Brešar, Sandi Klavžar, Nazanin Movarraei

The chromatic edge-stability number $es_{χ} (G)$ of a graph $G$ is the minimum number of edges whose removal results in a spanning subgraph $G^{'}$ with $χ (G^{'}) = χ (G) - 1$ . Edge-stabil…

math.CO2019

Graphs that are critical for the packing chromatic number

Boštjan Brešar, Jasmina Ferme

Given a graph $G$ , a coloring $c : V (G) ⟶ {1, \dots, k}$ such that $c (u) = c (v) = i$ implies that vertices $u$ and $v$ are at distance greater than $i$ , is called a packing…