The following pages link to (Q4281630):
Displaying 5 items.
- Coloring some classes of mixed graphs (Q858294) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- On two coloring problems in mixed graphs (Q2426450) (← links)
