The following pages link to (Q4281630):
Displaying 8 items.
- Building graphs from colored trees (Q612947) (← links)
- 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)
- Generation of colour-constrained spanning trees with application in symbolic circuit analysis (Q4355497) (← links)
- Tree-width and path-width of comparability graphs of interval orders (Q6184354) (← links)
