The following pages link to François Pirot (Q1689994):
Displaying 15 items.
- Distance colouring without one cycle length (Q1689995) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- Distributed algorithms for fractional coloring (Q2117704) (← links)
- Bipartite induced density in triangle-free graphs (Q2185224) (← links)
- Approximate strong edge-colouring of unit disk graphs (Q2193090) (← links)
- The relation between \(k\)-circularity and circularity of codes (Q2195624) (← links)
- Variations on the Petersen colouring conjecture (Q2288171) (← links)
- Strong cliques and forbidden cycles (Q2288223) (← links)
- Mixed circular codes (Q2295981) (← links)
- Coloring Powers and Girth (Q2827489) (← links)
- Distance Colouring Without One Cycle Length (Q4962592) (← links)
- Fractional Chromatic Number, Maximum Degree, and Girth (Q5013575) (← links)
- Coloring triangle‐free graphs with local list sizes (Q5136931) (← links)
- Occupancy fraction, fractional colouring, and triangle fraction (Q6080864) (← links)
- Strong chromatic index and Hadwiger number (Q6081549) (← links)
