Pages that link to "Item:Q2629566"
From MaRDI portal
The following pages link to Edge coloring of graphs, uses, limitation, complexity (Q2629566):
Displaying 5 items.
- Coloring the nodes of a directed graph (Q399510) (← 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)
- Coloring the edges of a directed graph (Q2353348) (← links)
- (Q5155414) (← links)