NEWS
Free Institutional Consultancy Services
New Feature: Compare Your Institution with the Previous Year
Find a Professional: Explore Experts Across 197 Disciplines in 220 Countries!
Find a Professional
Print Your Certificate
New! Young University / Institution Rankings 2025
New! Art & Humanities Rankings 2025
New! Social Sciences and Humanities Rankings 2025
Highly Cited Researchers 2025
AD
Scientific Index 2025
Scientist Rankings
University Rankings
Subject Rankings
Country Rankings
login
Login
person_add
Register
insights
H-Index Rankings
insights
i10 Productivity Rankings
format_list_numbered
Citation Rankings
subject
University Subject Rankings
school
Young Universities
format_list_numbered
Top 100 Scientists
format_quote
Top 100 Institutions
format_quote
Compare & Choose
local_fire_department
Country Reports
person
Find a Professional
Jan Petr
University of Cambridge - Cambridge / United Kingdom
Natural Sciences / Mathematical Sciences
AD Scientific Index ID: 5693918
Registration, Add Profile,
Premium Membership
Print Your Certificate
Ranking &
Analysis
Job
Experiences (0)
Education
Information (0)
Published Books (0)
Book Chapters (0)
Articles (0)
Presentations (0)
Lessons (0)
Projects (0)
Subject Leaders
Editorship, Referee &
Scientific Board (0 )
Patents /
Designs (0)
Academic Grants
& Awards (0)
Artistic
Activities (0)
Certificate / Course
/ Trainings (0)
Association &
Society Memberships (0)
Contact, Office
& Social Media
person_outline
Jan Petr's MOST POPULAR ARTICLES
1-)
The odd chromatic number of a planar graph is at most 8J Petr, J PortierGraphs and Combinatorics 39 (2), 28, 2023262023
2-)
A faster algorithm for Cops and RobbersJ Petr, J Portier, L VersteegenDiscrete Applied Mathematics 320, 11-14, 202272022
3-)
A note on Cops and Robbers, independence number, domination number and diameterJ Petr, J Portier, L VersteegenDiscrete Mathematics 346 (1), 113175, 202332023
4-)
The complexity of decomposing a graph into a matching and a bounded linear forestA Banerjee, JP Marciano, A Mond, J Petr, J PortierarXiv preprint arXiv:2304.03256, 202322023
5-)
A new lower bound on the optimal pebbling number of the gridJ Petr, J Portier, S StolarczykDiscrete Mathematics 346 (1), 113212, 202322023
ARTICLES
Add your articles
We use cookies to personalize our website and offer you a better experience. If you accept cookies, we can offer you special services.
Cookie Policy
Accept