The following pages link to Eric Sopena (Q175612):
Displaying 50 items.
- (Q226460) (redirect page) (← links)
- \(i\)-\textsc{Mark}: a new subtraction division game (Q265084) (← links)
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- (Q400507) (redirect page) (← links)
- Complete oriented colourings and the oriented achromatic number (Q400508) (← links)
- Dicots, and a taxonomic ranking for misère games (Q476289) (← links)
- Rainbow connection in oriented graphs (Q477332) (← links)
- The neighbour-sum-distinguishing edge-colouring game (Q526242) (← links)
- Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
- Homomorphisms of sparse signed graphs (Q782945) (← links)
- On the oriented chromatic number of Halin graphs (Q844210) (← links)
- Oriented vertex and arc colorings of outerplanar graphs (Q845839) (← links)
- The acircuitic directed star arboricity of subcubic graphs is at most four (Q856877) (← links)
- Compound Node-Kayles on paths (Q1019180) (← links)
- 2-asynchronous automata (Q1109571) (← links)
- Hypermap rewriting: A combinatorial approach (Q1178702) (← links)
- Some combinatorial aspects of time-stamp systems (Q1209725) (← links)
- On the maximum average degree and the oriented chromatic number of a graph (Q1304809) (← links)
- Good and semi-strong colorings of oriented planar graphs (Q1334637) (← links)
- Colorings and girth of oriented planar graphs (Q1356774) (← links)
- Acyclic \(k\)-strong coloring of maps on surfaces (Q1581455) (← links)
- On universal graphs for planar oriented graphs of a given girth (Q1584330) (← links)
- Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture (Q1627846) (← links)
- Strong rainbow connection in digraphs (Q1701123) (← links)
- 2-distance colorings of integer distance graphs (Q1717215) (← links)
- Oriented colourings of graphs with maximum degree three and four (Q1727768) (← links)
- Rainbow connections in digraphs (Q1752466) (← links)
- On the broadcast independence number of caterpillars (Q1752581) (← links)
- Octal games on graphs: the game 0.33 on subdivided stars and bistars (Q1784739) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- Ice sliding games (Q1791286) (← links)
- Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces (Q1810157) (← links)
- Incidence coloring of \(k\)-degenerated graphs (Q1827780) (← links)
- On deeply critical oriented graphs (Q1850516) (← links)
- Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\) (Q1850625) (← links)
- The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
- Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
- On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
- Broadcasts on paths and cycles (Q2192097) (← links)
- A connected version of the graph coloring game (Q2192130) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- Homomorphisms of signed graphs: an update (Q2225427) (← links)
- Proper connection and proper-walk connection of digraphs (Q2245028) (← links)
- On the complexity of determining the irregular chromatic index of a graph (Q2253909) (← links)
- An oriented version of the 1-2-3 conjecture (Q2259576) (← links)
- Incidence coloring -- cold cases (Q2282487) (← links)
- Incidence choosability of graphs (Q2312648) (← links)
- Edge weights and vertex colours: minimizing sum count (Q2334038) (← links)
