Open Access
RAIRO-Oper. Res.
Volume 58, Number 2, March-April 2024
Page(s) 1759 - 1770
Published online 16 April 2024
  • S.D. Andres, W. Hochst¨attler and C. Schallück, The game chromatic index of wheels. Discrete Appl. Math. 159 (2011) 1660–1665. [Google Scholar]
  • G. Bacsó, S. Gravier, A. Gyárfás, M. Preissmann and A. Sebő, Coloring the maximal cliques of graphs. SIAM J. Discrete Math. 17 (2004) 361–376. [Google Scholar]
  • C. Berge, Hypergraphs: Combinatorics of Finite Sets, 1st edition. North-Holland, Amsterdam (1989). [Google Scholar]
  • E.R. Berlekamp, J.H. Conway and R.K. Guy, Winning Ways for Your Mathematical Plays: Volume 1 and 2, 1st edition. A. K. Peters Press, Natick (1981). [Google Scholar]
  • C. Bujtás, M.A. Henning and Z. Tuza, Transversal game on hypergraphs and the ¾-conjecture on the total domination game. SIAM J. Discrete Math. 30 (2016) 1830–1847. [Google Scholar]
  • C. Bujtás, M.A. Henning and Z. Tuza, Bounds on the game transversal number in hypergraphs. Eur. J. Comb. 59 (2017) 34–50. [Google Scholar]
  • C.N. Campos, S. Dantas and C.P. de Mello, Colouring clique-hypergraphs of circulant graphs. Graphs Comb. 29 (2013) 1713–1720. [Google Scholar]
  • P. Dorbec and M.A. Henning, Game total domination for cycles and paths. Discrete Appl. Math. 208 (2016) 7–18. [Google Scholar]
  • E. Duch^ene, S. Gravier and J. Moncel, New results about impartial solitaire clobber. RAIRO: Oper. Res. 43 (2009) 463–482. [Google Scholar]
  • D. Duffus, B. Sands, N. Sauer and R.E. Woodrow, Two-colouring all two-element maximal antichains. J. Comb. Theory Ser. A 57 (1991) 109–116. [Google Scholar]
  • G. Durán, M.C. Lin, S. Mera and J.L. Szwarcfiter, Algorithms for finding clique-transversals of graphs. Ann. Oper. Res. 157 (2008) 37–45. [Google Scholar]
  • P. Erdős and J.L. Selfridge, On a combinatorial game. J. Comb. Theory Ser. A 14 (1973) 298–301. [Google Scholar]
  • P. Erdős, T. Gallai and Z. Tuza, Covering the cliques of a graph with vertices. Discrete Math. 108 (1992) 279–289. [Google Scholar]
  • A. Furtado, S. Dantas, C.M.H. Figueiredo and S. Gravier, On caterpillars of game chromatic number 4. Electron. Notes Theor. Comput. Sci. 346 (2019) 461–472. [Google Scholar]
  • S. Gravier, C.T. Hoàng and F. Maffray, Coloring the hypergraph of maximal cliques of a graph with no long path. Discrete Math. 272 (2003) 285–290. [Google Scholar]
  • M. Groshaus and J.L. Szwarcfiter, Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs. RAIRO: Oper. Res. 45 (2011) 209–222. [Google Scholar]
  • D. Hefetz, M. Krivelevich, M. Stojaković and T. Szabó, Positional Games. Birkh¨auser/Springer, Basel (2014). [Google Scholar]
  • M.A. Henning, S. Klavžar and D.F. Rall, The 4/5 upper bound on the game total domination number. Combinatorica 37 (2017) 223–251. [Google Scholar]
  • J. Meidanis, Edge coloring of cycle powers is easy (1998). Unpublished manuscript last visited 05/10/2022. [Google Scholar]
  • D.L. Oliveira, S. Dantas and A.G. Luiz, Results on the graceful game and range-relaxed graceful game, in XI European Conference on Combinatorics, Graph Theory and Applications (EuroComb 21), 2021, Barcelona. Trends in Mathematics: Research Perspectives CRM Barcelona. Vol. 14. Springer, Switzerland (2021) 214–220. [Google Scholar]
  • T.J. Schaefer, On the complexity of some two-person perfect-information games. J. Comput. Syst. Sci. 16 (1978) 185–225. [Google Scholar]
  • L.M. Torres and A.K. Wagler, Analyzing the dynamics of deterministic system from a hypergraph theoretical point of view. RAIRO: Oper. Res. 47 (2013) 321–330. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.