Pages that link to "Item:Q326946"
From MaRDI portal
The following pages link to Reducing graph coloring to clique search (Q326946):
Displaying 7 items.
- Coloring the nodes of a directed graph (Q399510) (← links)
- Clique-relaxed graph coloring (Q656032) (← links)
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- Reducing hypergraph coloring to clique search (Q2422750) (← links)
- Edge coloring of graphs, uses, limitation, complexity (Q2629566) (← links)
- (Q5155414) (← links)