The following pages link to Julien Portier (Q2092401):
Displayed 14 items.
- A note on cops and robbers, independence number, domination number and diameter (Q2092403) (← links)
- A new lower bound on the optimal pebbling number of the grid (Q2092437) (← links)
- Ternary Egyptian fractions with prime denominator (Q2153899) (← links)
- A faster algorithm for cops and robbers (Q2166209) (← links)
- The odd chromatic number of a planar graph is at most 8 (Q2689111) (← links)
- Bounds for the competition-independence game on trees (Q6177429) (← links)
- The odd chromatic number of a planar graph is at most 8 (Q6389527) (← links)
- On the number of minimum dominating sets and total dominating sets in forests (Q6403226) (← links)
- A proof of the 3/4 conjecture for the total domination game (Q6418945) (← links)
- Progress towards the 1/2-Conjecture for the domination game (Q6423245) (← links)
- A note on interval colourings of graphs (Q6428874) (← links)
- On interval colourings of graphs (Q6429014) (← links)
- The complexity of decomposing a graph into a matching and a bounded linear forest (Q6432350) (← links)
- Tight lower bounds for anti-concentration of Rademacher sums and Tomaszewski's counterpart problem (Q6440162) (← links)