Julien Portier

According to our database, Julien Portier authored at least 6 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Bounds for the competition-independence game on trees.

Jan Petr, Julien Portier

Discret. Math., March, 2024

2023

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

Jan Petr, Julien Portier

Graphs Comb., April, 2023

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

Jan Petr, Julien Portier, Leo Versteegen

Discret. Math., 2023

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

Jan Petr, Julien Portier, Szymon Stolarczyk

Discret. Math., 2023

The complexity of decomposing a graph into a matching and a bounded linear forest.

Agnijo Banerjee, João Pedro Marciano, Adva Mond, Jan Petr, Julien Portier

CoRR, 2023

2022

A faster algorithm for Cops and Robbers.

Jan Petr, Julien Portier, Leo Versteegen

Discret. Appl. Math., 2022