Builder-blocker general position games

DOI10.22049/CCO.2024.29122.1854MaRDI QIDQ7323543zbMATH OpenFDO

Authors Sandi Klavžar, Jing Tian, James Tuite

Publication date 1 September 2026

Published in Communications in Combinatorics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.22049/CCO.2024.29122.1854

Mathematics Subject Classification ID

Distance in graphs (05C12) Games on graphs (graph-theoretic aspects) (05C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A general position problem in graph theory
• Characterization of general position sets and its applications to cographs and bipartite graphs
• Domination game and an imagination strategy
• Domination games played on graphs
• Edge general position sets in Fibonacci and Lucas cubes
• Extremal problems for game domination number
• General position polynomials
• General position sets in two families of Cartesian product graphs
• Lower general position sets in graphs
• On a combinatorial game
• On monophonic position sets in graphs
• On the general position number of Mycielskian graphs
• On the general position number of two classes of graphs
• On the general position problem on Kneser graphs
• The edge general position problem
• The general position achievement game played on graphs
• The general position avoidance game and hardness of general position games
• The general position number of Cartesian products involving a factor with small diameter
• The general position problem on Kneser graphs and on some graph operations
• The Map-Coloring Game
• TRAVERSING A GRAPH IN GENERAL POSITION
• Universal lines in graphs

This page was built for publication: Builder-blocker general position games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7323543)