On-line graph coloring of P₅-free graphs
From MaRDI portal
Publication:2482722
DOI10.1007/S00236-007-0064-XzbMATH Open1147.05028OpenAlexW2115833325MaRDI QIDQ2482722FDOQ2482722
Authors: Iwona Cieślik 
Publication date: 23 April 2008
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-007-0064-x
Recommendations
clique covering on line algorithmcompetitive finctiongraphs without induced path on 5 verticeson line colouringquadratic lower bound
Cites Work
- Title not available (Why is that?)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Title not available (Why is that?)
- Dominating cliques in \(P_ 5\)-free graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Effective coloration
- On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
- On-line and first fit colorings of graphs
- Dominating cliques in graphs
- Optimal on-line coloring of circular arc graphs
- Effective on-line coloring of \(P_ 5\)-free graphs
- On-Line 3-Chromatic Graphs I. Triangle-Free Graphs
- On-line coloring and cliques covering for \(\mathbb K_{s,t}\)-free graphs
- On-line coloring of \(I_{s}\)-free graphs
Cited In (6)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
- 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
- Star coloring of certain graph classes
- Star chromatic bounds
- Advice complexity of maximum independent set in sparse and bipartite graphs
This page was built for publication: On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482722)
