Pages that link to "Item:Q499473"
From MaRDI portal
The following pages link to First-fit coloring on interval graphs has performance ratio at least 5 (Q499473):
Displaying 13 items.
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- Batch Coloring of Graphs (Q2971156) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- A Dichotomy Theorem for First-Fit Chain Partitions (Q5218437) (← links)
- (Q5874480) (← links)
- (Q6084415) (← links)
- On-line interval graphs coloring — Modification of the First-Fit algorithm and its performance ratio (Q6115748) (← links)
- Online coloring of short intervals (Q6201896) (← links)
- On \(b\)-greedy colourings and \(z\)-colourings (Q6633541) (← links)
