On-line P-coloring of graphs
From MaRDI portal
Publication:5437222
DOI10.7151/DMGT.1331zbMATH Open1138.05019DBLPjournals/dmgt/Borowiecki06aOpenAlexW2008014112WikidataQ62043631 ScholiaQ62043631MaRDI QIDQ5437222FDOQ5437222
Authors: Piotr Borowiecki
Publication date: 18 January 2008
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1331
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cited In (15)
- A tight bound for online colouring of disk graphs
- Online edge coloring via tree recurrences and correlation decay
- Application of polynomial method to on-line list colouring of graphs
- Title not available (Why is that?)
- Online Bounded Coloring of Permutation and Overlap Graphs
- Iterated colorings of graphs.
- On-line approach to off-line coloring problems on graphs with geometric representations
- Online chromatic number is PSPACE-complete
- Computational aspects of greedy partitioning of graphs
- Online Dual Edge Coloring of Paths and Trees
- Title not available (Why is that?)
- Online hypergraph coloring with rejection
- On-line choice number of complete multipartite graphs: an algorithmic approach
- Online multi-coloring on the path revisited
- Online coloring co-interval graphs
This page was built for publication: On-line P-coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437222)