Pages that link to "Item:Q2462336"
From MaRDI portal
The following pages link to A dualistic approach to bounding the chromatic number of a graph (Q2462336):
Displaying 8 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Interleaved adjoints of directed graphs (Q648963) (← links)
- Using stable sets to bound the chromatic number (Q1014408) (← links)
- Colourful theorems and indices of homomorphism complexes (Q1953386) (← links)
- Duality pairs and homomorphisms to oriented and unoriented cycles (Q2048544) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- New Bounds for the Dichromatic Number of a Digraph (Q5377790) (← links)