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

(37)

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