The following pages link to Coloring inductive graphs on-line (Q1312187):
Displaying 22 items.
- On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
- A note on algebraic expressions of rhomboidal labeled graphs (Q324971) (← links)
- First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- First-fit chromatic numbers of \(d\)-degenerate graphs (Q427876) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- A note on the online first-fit algorithm for coloring \(k\)-inductive graphs (Q975523) (← links)
- Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- Efficacy of line-based explicit and compact high-order finite difference schemes for hybrid unstructured grids (Q2108589) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- R.e. Prime powers and total rigidity (Q2281321) (← links)
- Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs (Q2357161) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Online Conflict-Free Colouring for Hypergraphs (Q4933597) (← links)
- An approximation scheme for bin packing with conflicts (Q5054839) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- (Q5155667) (← links)
- Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)
- Colouring bottomless rectangles and arborescences (Q6110074) (← links)
