Pages that link to "Item:Q1202928"
From MaRDI portal
The following pages link to The complexity of coloring games on perfect graphs (Q1202928):
Displaying 14 items.
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
- PSPACE-hardness of two graph coloring games (Q2132363) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- Game chromatic number of generalized Petersen graphs and Jahangir graphs (Q2218005) (← links)
- Online coloring a token graph (Q2303438) (← links)
- The Parallel Complexity of Coloring Games (Q2819445) (← links)
- Hypergraph Coloring Games and Voter Models (Q2900580) (← links)
- Game-perfect Graphs with Clique Number 2 (Q3439456) (← links)
- (Q3511139) (← links)
- A Game Theoretic Approach for Efficient Graph Coloring (Q3596717) (← links)
- ON THE COMPLEXITY OF SOME COLORING GAMES (Q3988839) (← links)
- Hypergraph Coloring Games and Voter Models (Q4985349) (← links)
- Abstract colorings, games and ultrafilters (Q6098399) (← links)