Pages that link to "Item:Q1823960"
From MaRDI portal
The following pages link to Interval vertex-coloring of a graph with forbidden colors (Q1823960):
Displaying 13 items.
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- Comparison of neural and heuristic methods for a timetabling problem (Q1268158) (← links)
- Interval edge coloring of a graph with forbidden colors (Q1309462) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- Restraints permitting the largest number of colourings (Q1786873) (← links)
- Tree-coloring problems of bounded treewidth graphs (Q2292136) (← links)
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (Q2480207) (← links)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
- (Q5708510) (← links)
- A broken cycle theorem for the restrained chromatic function (Q5742940) (← links)
- INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES (Q5883705) (← links)
