22 citations · 31 across the 7 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022
On the number of minimum dominating sets and total dominating sets in forests
Jan Petr, Julien Portier, Leo Versteegen
We show that the maximum number of minimum dominating sets of a forest with domination number is at most and construct for each a tree with domination number $…
math.CO2022★ 1 cited
A note on Cops and Robbers, independence number, domination number and diameter
Jan Petr, Julien Portier, Leo Versteegen
We study relations between diameter , domination number , independence number and cop number of a connected graph , showing (i.) $c(G) \leq α(G)-\lfloo…
math.CO2022★ 22 cited
The odd chromatic number of a planar graph is at most 8
Jan Petr, Julien Portier
Petruševski and Škrekovski \cite{odd9} recently introduced the notion of an odd colouring of a graph: a proper vertex colouring of a graph is said to be \emph{odd} if for each…