×
Author ID: portier.julien Recent zbMATH articles by "Portier, Julien"
Published as: Portier, Julien

Citations contained in zbMATH Open

5 Publications have been cited 12 times in 12 Documents Cited by Year
The odd chromatic number of a planar graph is at most 8. Zbl 1514.05045
Petr, Jan; Portier, Julien
7
2023
A faster algorithm for cops and robbers. Zbl 1495.05191
Petr, Jan; Portier, Julien; Versteegen, Leo
2
2022
Ternary Egyptian fractions with prime denominator. Zbl 1493.11075
Mond, Adva; Portier, Julien
1
2022
A note on interval colourings of graphs. Zbl 07878009
Axenovich, Maria; Girão, António; Hollom, Lawrence; Portier, Julien; Powierski, Emil; Savery, Michael; Tamitegama, Youri; Versteegen, Leo
1
2024
A note on cops and robbers, independence number, domination number and diameter. Zbl 1502.05191
Petr, Jan; Portier, Julien; Versteegen, Leo
1
2023
A note on interval colourings of graphs. Zbl 07878009
Axenovich, Maria; Girão, António; Hollom, Lawrence; Portier, Julien; Powierski, Emil; Savery, Michael; Tamitegama, Youri; Versteegen, Leo
1
2024
The odd chromatic number of a planar graph is at most 8. Zbl 1514.05045
Petr, Jan; Portier, Julien
7
2023
A note on cops and robbers, independence number, domination number and diameter. Zbl 1502.05191
Petr, Jan; Portier, Julien; Versteegen, Leo
1
2023
A faster algorithm for cops and robbers. Zbl 1495.05191
Petr, Jan; Portier, Julien; Versteegen, Leo
2
2022
Ternary Egyptian fractions with prime denominator. Zbl 1493.11075
Mond, Adva; Portier, Julien
1
2022