论文信息 - The graph distance game

The graph distance game

In the graph distance game, two players alternate in constructing a maximal path. The objective function is the distance between the two endpoints of the path, which one player tries to maximize and the other tries to minimize. In this note, we examine the distance game for various graphs, and provide general bounds, exact results for special graphs, and an algorithm for trees. Computer calculations suggest interesting conjectures for grids.

[1] Matthew Walsh. The Competition Chromatic Numbers of a Graph , 2003 .

[2] Peter J. Slater,et al. Competition Parameters of a Graph , 2007 .

[3] J. Beck. Combinatorial Games: Tic-Tac-Toe Theory , 2008 .

[4] E. Berlekamp,et al. Winning Ways for Your Mathematical Plays , 1983 .

[5] U. Faigle,et al. On the game chromatic number of some classes of graphs , 1991 .

[6] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.