Jan Petr | Department of Pure Mathematics and Mathematical Statistics

skip to content

Publications

Colourings, dominating sets and wreaths

J Petr

(2025)

(doi: 10.17863/CAM.123206)

On the number of minimum dominating sets and total dominating sets in forests

J Petr, J Portier, L Versteegen

– Journal of Graph Theory

(2024)

106,

976

(doi: 10.1002/jgt.23107)

Bounds for the competition-independence game on trees

J Petr, J Portier

– Discrete Mathematics

(2024)

347,

113827

(doi: 10.1016/j.disc.2023.113827)

The Odd Chromatic Number of a Planar Graph is at Most 8

J Petr, J Portier

– Graphs and Combinatorics

(2023)

39,

28

(doi: 10.1007/s00373-023-02617-z)

A new lower bound on the optimal pebbling number of the grid

J Petr, J Portier, S Stolarczyk

– Discrete Mathematics

(2023)

346,

113212

(doi: 10.1016/j.disc.2022.113212)

A note on cops and robbers, independence number, domination number and diameter

J Petr, J Portier, L Versteegen

– Discrete Mathematics

(2023)

346,

113175

(doi: 10.1016/j.disc.2022.113175)

A faster algorithm for Cops and Robbers

J Petr, J Portier, L Versteegen

– Discrete Applied Mathematics

(2022)

320,

11

(doi: 10.1016/j.dam.2022.05.019)