Jogos combinatórios em grafos: jogo Timber e jogo de Coloração

• Autor(a) principal: Furtado, Ana Luísa Carvalho
• Data de Publicação: 2017
• Tipo de documento: Tese
• Idioma: por
• Título da fonte: Repositório Institucional da UFRJ
• Texto Completo: http://hdl.handle.net/11422/6400
• topic: Otimização combinatória; Teoria dos grafos; Teoria dos jogos; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::MATEMATICA DA COMPUTACAO

Studies three competitive combinatorial games. The timber game is played in digraphs, with each arc representing a domino, and the arc direction indicates the direction in which it can be toppled, causing a chain reaction. The player who topples the last domino is the winner. A P-position is an orientation of the edges of a graph in which the second player wins. If the graph has cycles, then the graph has no P-positions and, for this reason, timber game is only interesting when played in trees. We determine the number of P-positions in three caterpillar families and a lower bound for the number of P-positions in any caterpillar. Moreover, we prove that a tree has P-positions if, and only if, it has an even number of edges. In the coloring game, Alice and Bob take turns properly coloring the vertices of a graph, Alice trying to minimize the number of colors used, while Bob tries to maximize them. The game chromatic number is the smallest number of colors that ensures that the graph can be properly colored despite of Bob's intention. We determine the game chromatic number for three forest subclasses (composed by caterpillars), we present two su cient conditions and two necessary conditions for any caterpillar to have game chromatic number equal to 4. In the marking game, Alice and Bob take turns selecting the unselected vertices of a graph, and Alice tries to ensure that for some integer k, every unselected vertex has at most k − 1 neighbors selected. The game coloring number is the smallest k possible. We established lower and upper bounds for the Nordhaus-Gaddum type inequality for the number of P-positions of a caterpillar, the game chromatic and coloring numbers in any graph.