Bounds for the competition-independence game on trees

DOI10.1016/J.DISC.2023.113827arXiv2303.09993MaRDI QIDQ6177429

Jan Petr, Julien Portier

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.09993

zbMATH Keywords

treesindependent setsgames on graphscompetition-independence game

Mathematics Subject Classification ID

Games involving graphs (91A43) Mathematical programming (90Cxx) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• The 4/5 upper bound on the game total domination number
• Game domination number
• Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
• Domination Game and an Imagination Strategy
• Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
• My Favorite Domination Game Conjectures
• Extremal Problems for Game Domination Number
• Domination Games Played on Graphs

This page was built for publication: Bounds for the competition-independence game on trees