Pages that link to "Item:Q324375"
From MaRDI portal
The following pages link to Asymmetric coloring games on incomparability graphs (Q324375):
Displaying 6 items.
- Conflict-free coloring of string graphs (Q2022631) (← links)
- PSPACE-hardness of two graph coloring games (Q2132363) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- The connected greedy coloring game (Q2699943) (← links)
- Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete (Q2947029) (← links)
- (Q5167787) (redirect page) (← links)