Pages that link to "Item:Q2223701"
From MaRDI portal
The following pages link to Tight bounds for online coloring of basic graph classes (Q2223701):
Displaying 15 items.
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
- Coloring inductive graphs on-line (Q1312187) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- Online coloring known graphs (Q1967115) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Max-coloring and online coloring with bandwidths on interval graphs (Q3189018) (← links)
- Online Bounded Coloring of Permutation and Overlap Graphs (Q3503553) (← links)
- (Q4010319) (← links)
- Lower bounds for on-line graph coloring (Q4763409) (← links)
- Parameterized and Exact Computation (Q5311514) (← links)
- Structural Information and Communication Complexity (Q5710098) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5970811) (← links)
- Online coloring of short intervals (Q6201896) (← links)
- Online dominating set and coloring (Q6606165) (← links)