Pages that link to "Item:Q4858840"
From MaRDI portal
The following pages link to Optimal on-line coloring of circular arc graphs (Q4858840):
Displaying 9 items.
- On-line chain partitions of orders: a survey (Q766153) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- An \(0(n^{1.5})\) algorithm to color proper circular arcs (Q1824396) (← links)
- The on-line first-fit algorithm for radio frequency assignment problems. (Q1853136) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs (Q2482722) (← links)
- On-line coloring and cliques covering for \(\mathbb K_{s,t}\)-free graphs (Q2576659) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
- Selfish Routing and Path Coloring in All-Optical Networks (Q5458507) (← links)
