Information Processing Letters
On-Line and First-Fit Coloring of Graphs That Do Not Induce $P_5$
SIAM Journal on Discrete Mathematics
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
Discrete Applied Mathematics
Three-colourbility and forbidden subgraphs. II: polynomial algorithms
Discrete Mathematics
Discrete Mathematics
Developments from a June 1996 seminar on Online algorithms: the state of the art
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Some results on maximum stable sets in certain P5-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Vertex Colouring and Forbidden Subgraphs – A Survey
Graphs and Combinatorics
On-line graph coloring of $${\mathbb{P}_5}$$-free graphs
Acta Informatica
Perfect coloring and linearly χ-bound P6-free graphs
Journal of Graph Theory
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
| Hi-index | 0.04 |
We show that given any ordering of the vertices of a {P"5,K"4-e}-free graph G, the First-Fit coloring algorithm colors its vertices using at most 2@w(G)-1 colors (where @w(G) is the clique number of G) via a characterization proved by using the known results. We also construct {P"5,K"4-e}-free graphs to show that this bound cannot be improved. A similar result is proved for the class of {P"5,paw}-free graphs.