The following pages link to Consecutive colorings of graphs (Q3770560):
Displaying 14 items.
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- Cycle-based facets of chromatic scheduling polytopes (Q1013295) (← links)
- Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques (Q1013296) (← links)
- Sequential coloring versus Welsh-Powell bound (Q1121275) (← links)
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths (Q1179200) (← links)
- Chromatic scheduling and frequency assignment (Q1327228) (← links)
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- On the use of some known methods for \(T\)-colorings of graphs (Q2367012) (← links)
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (Q2480207) (← links)
- On the combinatorial structure of chromatic scheduling polytopes (Q2500535) (← links)
- 3-consecutive C-colorings of graphs (Q2997600) (← links)
- (Q4529311) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- (Q5708510) (← links)
