Pages that link to "Item:Q925259"

The following pages link to A note on first-fit coloring of interval graphs (Q925259):

Displaying 23 items.

• First-fit coloring on interval graphs has performance ratio at least 5 (Q499473) (← links)
• First-fit coloring of bounded tolerance graphs (Q531602) (← links)
• First-Fit is linear on posets excluding two long incomparable chains (Q651432) (← links)
• On the max coloring problem (Q690449) (← links)
• On-line chain partitions of orders: a survey (Q766153) (← links)
• Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
• Complexity of Grundy coloring and its variants (Q1752449) (← links)
• An easy subexponential bound for online chain partitioning (Q1753118) (← links)
• Batch coloring of graphs (Q1755745) (← links)
• On-line dimension for posets excluding two long incomparable chains (Q1943697) (← links)
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
• (Q2857340) (← links)
• Batch Coloring of Graphs (Q2971156) (← links)
• A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
• Reverse Mathematics and Grundy colorings of graphs (Q3053234) (← links)
• On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
• Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
• A Dichotomy Theorem for First-Fit Chain Partitions (Q5218437) (← links)
• (Q5874480) (← links)
• Max-coloring of vertex-weighted graphs (Q5964985) (← 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)