The following pages link to Éric Sopena (Q175612):
Displaying 13 items.
- On the oriented game chromatic number (Q5942568) (← links)
- Acyclic colouring of 1-planar graphs (Q5954081) (← links)
- Connected colourings of complete graphs and hypergraphs (Q5964989) (← links)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)
- A proof of the multiplicative 1-2-3 conjecture (Q6057483) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
- On the oriented achromatic number of graphs (Q6202937) (← links)
- Proper connection and proper-walk connection of digraphs (Q6349034) (← links)
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs (Q6378776) (← links)
- Homomorphisms of (n,m)-graphs with respect to generalised switch (Q6507789) (← links)
- Broadcast independence number of oriented circulant graphs (Q6524026) (← links)
- On the broadcast independence number of circulant graphs (Q6637055) (← links)
- Upper broadcast domination number of caterpillars with no trunks (Q6669817) (← links)
