The following pages link to Théo Pierron (Q777376):
Displayed 32 items.
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Coloring squares of graphs with mad constraints (Q2009007) (← links)
- Density maximizers of layered permutations (Q2088699) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- Rings of invariants for the three-dimensional modular representations of elementary abelian \(p\)-groups of rank four (Q2631159) (← links)
- Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- Improved square coloring of planar graphs (Q2685324) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)
- (Q5875547) (← links)
- Recoloring Planar Graphs of Girth at Least Five (Q5883290) (← links)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)
- The smallest 5-chromatic tournament (Q6076253) (← links)
- (Q6083430) (← links)
- What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs (Q6120956) (← links)
- (Q6128586) (← links)
- Extremal independent set reconfiguration (Q6133144) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
- Strengthening a Theorem of Meyniel (Q6158364) (← links)
- (Q6179344) (← links)
- A Brooks-like result for graph powers (Q6181987) (← links)
- (Q6192476) (← links)
- (Q6192502) (← links)
- (Q6192510) (← links)
- Improved pyrotechnics: closer to the burning number conjecture (Q6197306) (← links)
- Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy (Q6310429) (← links)
- Hadwiger meets Cayley (Q6340569) (← links)
- Recolouring planar graphs of girth at least five (Q6384567) (← links)
- Improved square coloring of planar graphs (Q6386538) (← links)