On-Line and First-fit Coloring of Graphs that Do Not Induce P₅

Recommendations

scientific article; zbMATH DE number 65699
Coloring interval graphs with First-Fit
Effective on-line coloring of $P_ 5$-free graphs
An on-line graph coloring algorithm with sublinear performance ratio
On-line and first fit colorings of graphs

Cited in

(32)

On-line P-coloring of graphs
On-line coloring of perfect graphs
On graphs with no induced five‐vertex path or paraglider
An improved algorithm for online unit clustering
A Dichotomy Theorem for First-Fit Chain Partitions
On-Line Coloring of H-Free Bipartite Graphs
On-line graph coloring of ${\mathbb{P}_5}$-free graphs
Bounded families for the on-line $t$-relaxed coloring
A coloring problem for weighted graphs
scientific article; zbMATH DE number 4170931 (Why is no real title available?)
Lower bounds for on-line graph colorings
An on-line competitive algorithm for coloring $P_8$-free bipartite graphs
On-line coloring and cliques covering for $\mathbb K_{s,t}$-free graphs
Square-Free Graphs with No Six-Vertex Induced Path
THE CHROMATIC NUMBER OF -FREE GRAPHS
Reverse mathematics and Grundy colorings of graphs
First-fit coloring of $\{P_{5},K_{4}-e\}$-free graphs
On the on-line chromatic number of the family of on-line 3-chromatic graphs
Obtaining online ecological colourings by generalizing first-fit
A randomized algorithm for online unit clustering
Coloring graphs with no induced five‐vertex path or gem
First-fit colorings of graphs with no cycles of a prescribed even length
An on-line competitive algorithm for coloring bipartite graphs without long induced paths
scientific article; zbMATH DE number 65699 (Why is no real title available?)
More bounds for the Grundy number of graphs
On-line coloring of $I_{s}$-free graphs
On the performance of the first-fit coloring algorithm on permutation graphs
Coloring interval graphs with First-Fit
On-line and first fit colorings of graphs
Bounds for the Grundy chromatic number of graphs in terms of domination number
Variable sized online interval coloring with bandwidth
Inequalities for the Grundy chromatic number of graphs

This page was built for publication: On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863971)