Pages that link to "Item:Q4747899"
From MaRDI portal
The following pages link to Approximate Colouring Algorithms for Composite Graphs (Q4747899):
Displaying 3 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)