First-fit coloring of bounded tolerance graphs
From MaRDI portal
Publication:531602
DOI10.1016/J.DAM.2010.05.002zbMATH Open1210.05043OpenAlexW2074455464MaRDI QIDQ531602FDOQ531602
H. A. Kierstead, Karin R. Saoub
Publication date: 19 April 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.05.002
Recommendations
Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- First-Fit Algorithm for the On-Line Chain Partitioning Problem
- On some packing problem related to dynamic storage allocation
- An Effective Version of Dilworth's Theorem
- Title not available (Why is that?)
- Coloring interval graphs with First-Fit
- The Linearity of First-Fit Coloring of Interval Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Induced subtrees in graphs of large chromatic number
- Radius two trees specify χ‐bounded classes
- On-Line Coloring and Recursive Graph Theory
- Title not available (Why is that?)
- Tolerance graphs
- Title not available (Why is that?)
- First-fit coloring on interval graphs has performance ratio at least 5
- A note on first-fit coloring of interval graphs
- OPTVersusLOADin Dynamic Storage Allocation
- A polynomial time approximation algorithm for dynamic storage allocation
- Tolerance graphs, and orders
- First-fit coloring of bounded tolerance graphs
Cited In (6)
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)