Pages that link to "Item:Q4109290"
From MaRDI portal
The following pages link to Algorithms for finding in the lump both bounds of the chromatic number of a graph (Q4109290):
Displayed 4 items.
- On a reduction of the interval coloring problem to a series of bandwidth coloring problems (Q633552) (← links)
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths (Q1179200) (← links)
- Construction of university faculty timetables using logic programming techniques (Q1186311) (← links)