Jan Petr

Available identifiers

zbMath Open petr.janMaRDI QIDQ2037572

List of research outcomes

Publication	Date of Publication	Type
Bounds for the competition-independence game on trees	2024-01-17	Paper
The complexity of decomposing a graph into a matching and a bounded linear forest	2023-04-06	Paper
The odd chromatic number of a planar graph is at most 8	2023-03-09	Paper
A note on cops and robbers, independence number, domination number and diameter	2022-11-02	Paper
A new lower bound on the optimal pebbling number of the grid	2022-11-02	Paper
A faster algorithm for cops and robbers	2022-08-24	Paper
On the number of minimum dominating sets and total dominating sets in forests	2022-06-27	Paper
The odd chromatic number of a planar graph is at most 8	2022-01-28	Paper
On longest palindromic subwords of finite binary words	2021-07-08	Paper
Slowdown for the geodesic-biased random walk	2019-12-12	Paper
Reconstructing almost all of a point set in $\mathbb{R}^d$ from randomly revealed pairwise distances	0001-01-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Jan Petr