Pages that link to "Item:Q3804717"

The following pages link to On-line and first fit colorings of graphs (Q3804717):

Displaying 50 items.

• On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
• First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
• Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
• On the complexity of injective colorings and its generalizations (Q387816) (← links)
• On the online track assignment problem (Q423916) (← links)
• Online coloring of bipartite graphs with and without advice (Q486981) (← links)
• First-fit coloring on interval graphs has performance ratio at least 5 (Q499473) (← links)
• An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
• Graph coloring with rejection (Q632809) (← links)
• Online coloring of hypergraphs (Q656575) (← links)
• On the max coloring problem (Q690449) (← links)
• On distance constrained labeling of disk graphs (Q703553) (← links)
• On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
• On-line chain partitions of orders: a survey (Q766153) (← links)
• A randomized algorithm for online unit clustering (Q839627) (← links)
• Results on the Grundy chromatic number of graphs (Q856867) (← links)
• Online promise problems with online width metrics (Q859981) (← links)
• Online unit clustering: Variations on a theme (Q954982) (← links)
• Comparing first-fit and next-fit for online edge coloring (Q964390) (← links)
• First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
• Grundy number and products of graphs (Q968418) (← links)
• Online coloring graphs with high girth and high odd girth (Q974990) (← links)
• Online hypergraph coloring (Q975516) (← links)
• A note on the online first-fit algorithm for coloring \(k\)-inductive graphs (Q975523) (← links)
• An improved algorithm for online unit clustering (Q1040649) (← links)
• Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
• An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
• A polynomial time approximation algorithm for dynamic storage allocation (Q1176726) (← links)
• Effective on-line coloring of \(P_ 5\)-free graphs (Q1180418) (← links)
• The online graph bandwidth problem (Q1198951) (← links)
• The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
• On-line coloring \(k\)-colorable graphs (Q1264277) (← links)
• Coloring inductive graphs on-line (Q1312187) (← links)
• On the mean chromatic number (Q1322240) (← links)
• Lower bounds for on-line graph coloring (Q1331951) (← links)
• On-line coloring of perfect graphs (Q1375694) (← links)
• On-line 3-chromatic graphs. II: Critical graphs (Q1377872) (← links)
• Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561) (← links)
• Obtaining online ecological colourings by generalizing first-fit (Q1678751) (← links)
• Recoloring graphs via tree decompositions (Q1686264) (← links)
• Complexity of Grundy coloring and its variants (Q1752449) (← links)
• Batch coloring of graphs (Q1755745) (← links)
• On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
• On-line vertex-covering (Q1770381) (← links)
• The on-line first-fit algorithm for radio frequency assignment problems. (Q1853136) (← links)
• Online independent sets. (Q1853575) (← links)
• On-line coloring of geometric intersection graphs (Q1862127) (← links)
• Coloring interval graphs with First-Fit (Q1898342) (← links)
• On the on-line chromatic number of the family of on-line 3-chromatic graphs (Q1916112) (← links)
• On the Nash number and the diminishing Grundy number of a graph (Q2127607) (← links)