P3-Games
Abstract
Without further ado, we present the P3-game. The P3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected P3-game is fascinating. We show that the connected P3-game is polynomially decidable for classes such as trees, chordal graphs, ladders, cacti, outerplanar graphs and circular arc graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.