First-fit coloring of bounded tolerance graphs
From MaRDI portal
Publication:531602
Recommendations
Cites work
- scientific article; zbMATH DE number 3853140 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 3769624 (Why is no real title available?)
- scientific article; zbMATH DE number 3480625 (Why is no real title available?)
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- scientific article; zbMATH DE number 6469191 (Why is no real title available?)
- scientific article; zbMATH DE number 3318560 (Why is no real title available?)
- OPTVersusLOADin Dynamic Storage Allocation
- A note on first-fit coloring of interval graphs
- A polynomial time approximation algorithm for dynamic storage allocation
- An Effective Version of Dilworth's Theorem
- Coloring interval graphs with First-Fit
- First-Fit Algorithm for the On-Line Chain Partitioning Problem
- First-fit coloring of bounded tolerance graphs
- First-fit coloring on interval graphs has performance ratio at least 5
- Induced subtrees in graphs of large chromatic number
- On some packing problem related to dynamic storage allocation
- On-Line Coloring and Recursive Graph Theory
- Radius two trees specify χ‐bounded classes
- The Linearity of First-Fit Coloring of Interval Graphs
- Tolerance graphs
- Tolerance graphs, and orders
Cited in
(5)
This page was built for publication: First-fit coloring of bounded tolerance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531602)