Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Graph labeling games

Zsolt Tuza

Abstract

We propose the study of many new variants of two-person graph labeling games. Hardly anything has been done in this wide open field so far.

Graph labeling games

Abstract

We propose the study of many new variants of two-person graph labeling games. Hardly anything has been done in this wide open field so far.

Paper Structure

This paper contains 14 sections, 3 theorems, 1 equation.

Table of Contents

  1. Introduction
  2. General setting
  3. Earlier papers on labeling games
  4. Vertex-magic edge- and total labeling games
  5. The $L(d,1)$-labeling game
  6. Achievement/$\!$Avoidance and Maker--Breaker games
  7. Achievement and Avoidance
  8. Maker--Breaker
  9. New games from graceful labeling: edge-distinguishing games with differences
  10. The graceful game
  11. New games from antimagic labeling: edge-distinguishing games with sums
  12. The game on cycles
  13. Variants of games
  14. Conclusion

Key Result

Proposition 2.5

Alice can win the Graceful Game on any star $K_{1,n-1}$; and Bob has a winning strategy on every path of order at least four.

Theorems & Definitions (4)

  • Proposition 2.5
  • Proposition 2.6
  • Proposition 3.5
  • Example 4.1