Pages that link to "Item:Q5300485"
From MaRDI portal
The following pages link to First-Fit Coloring of Incomparability Graphs (Q5300485):
Displaying 5 items.
- A subexponential upper bound for the on-line chain partitioning problem (Q276436) (← links)
- Asymmetric coloring games on incomparability graphs (Q324375) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← links)
- Coloring interval graphs with First-Fit (Q1898342) (← links)
- A Dichotomy Theorem for First-Fit Chain Partitions (Q5218437) (← links)