The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles

DOI10.1051/ro/2024054zbMath1540.0512MaRDI QIDQ6550916

Simone Dantas, Sylvain Gravier, Wilder P. Mendes

Publication date: 5 June 2024

Published in: RAIRO. Operations Research (Search for Journal in Brave)

zbMATH Keywords

hypergraphstransversalcombinatorial games

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Game total domination for cycles and paths
• Bounds on the game transversal number in hypergraphs
• The game chromatic index of wheels
• Algorithms for finding clique-transversals of graphs
• Two-colouring all two-element maximal antichains
• Covering the cliques of a graph with vertices
• On the complexity of some two-person perfect-information games
• Coloring the hypergraph of maximal cliques of a graph with no long path
• The 4/5 upper bound on the game total domination number
• On caterpillars of game chromatic number 4
• Positional games
• Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs,
• New results about impartial solitaire clobber
• Coloring the Maximal Cliques of Graphs
• Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view
• On a combinatorial game
• Colouring clique-hypergraphs of circulant graphs
• Results on the graceful game and range-relaxed graceful game

This page was built for publication: The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles