P_3-Games
Discrete Mathematics
2016-08-19 v1
Abstract
Without further ado, we present the P_3-game. The P_3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected P_3-game is fascinating. We show that the connected P_3-game is polynomially decidable for classes such as trees, chordal graphs, ladders, cacti, outerplanar graphs and circular arc graphs.
Keywords
Cite
@article{arxiv.1608.05169,
title = {P_3-Games},
author = {Wing-Kai Hon and Ton Kloks and Fu-Hong Liu and Hsiang-Hsuan Liu and Tao-Ming Wang},
journal= {arXiv preprint arXiv:1608.05169},
year = {2016}
}