Vertex-edge marking score of certain triangular lattices

zbMATH Open1497.05178arXiv2201.03633MaRDI QIDQ5869451FDOQ5869451

Authors:

Publication date: 28 September 2022

Abstract: The vertex-edge marking game is played between two players on a graph, $G=(V,E)$, with one player marking vertices and the other marking edges. The players want to minimize/maximize, respectively, the number of marked edges incident to an unmarked vertex. The vertex-edge coloring number for $G$ is the maximum score achievable with perfect play. Brev{s}ar et al., [4], give an upper bound of $5$ for the vertex-edge coloring number for finite planar graphs. It is not known whether the bound is tight. In this paper, in response to questions in [4], we show that the vertex-edge coloring number for the infinite regular triangularization of the plane is 4. We also give two general techniques that allow us to calculate the vertex-edge coloring number in many related triangularizations of the plane.

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

Recommendations

• On a vertex-edge marking game on graphs
• Very asymmetric marking games
• Refined activation strategy for the marking game
• The game coloring number of planar graphs
• Asymmetric marking games on line graphs

zbMATH Keywords

vertex-edge coloring numbervertex-edge marking game

Mathematics Subject Classification ID

2-person games (91A05) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites Work

• A note on the history of the four-colour conjecture
• Game chromatic number of Cartesian product graphs
• Title not available (Why is that?)
• ON THE COMPLEXITY OF SOME COLORING GAMES
• The four color proof suffices
• On a vertex-edge marking game on graphs
• Title not available (Why is that?)

Cited In (1)

• On a vertex-edge marking game on graphs

This page was built for publication: Vertex-edge marking score of certain triangular lattices

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