Asymmetric game perfect graphs and the circular coloring game of weighted graphs
Panagiotis Zacharopoulos · PUB – Publications at Bielefeld University (Bielefeld University) · 2011
Preliminaries 2 Asymmetric Game Perfect Graphs 2.1 Asymmetric Game Perfect Graphs . . . . . . . . . . . . . . . . .2.2 A (1,n) -Game Perfect Graphs with Clique Number 2 . . . . . . .2.3 B (1,n) -Game Perfect Graphs with Clique Number 2 . . . . . . .2.4 B (n,1) -Game Perfect Graphs with Clique Number 2 . . . . . . .2.5 Construction of B (n,1) -Nice Graphs with Clique Number 2 . . .2.6 A (n,1) -Game Perfect Graphs with Clique Number 2 . . . . . . .2.7 (n, 1)-Game Perfect Graphs with Clique Number 2 . . . . . . . .2.8 (1, n)-Game Perfect Graphs with Clique Number 2 . . . . . . . .2.9 (n, m)-Game Perfect Graphs with Clique Number 2 and n, m ≥ 2 3 The Circular Two-Person Game on Weighted Graphs 3.1 The Circular Two-Person Game on Weighted Graphs . . . . . . . .