Dynamic coloring of graphs
From MaRDI portal
Publication:2883161
zbMATH Open1236.05077MaRDI QIDQ2883161FDOQ2883161
Authors: Piotr Borowiecki, Elżbieta Sidorowicz
Publication date: 11 May 2012
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: http://iospress.metapress.com/content/w227640503032482/fulltext.html
Recommendations
Cited In (19)
- A MODEL OF GRAPH COLORING DYNAMICS WITH ATTENTION WAVES AND STRATEGIC WAITING
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- Dynamic list coloring of bipartite graphs
- On the dynamic coloring of graphs
- Sliding window temporal graph coloring
- Title not available (Why is that?)
- Dynamic \(F\)-free coloring of graphs
- Computational aspects of greedy partitioning of graphs
- Title not available (Why is that?)
- On Computational Aspects of Greedy Partitioning of Graphs
- Dynamic graph coloring
- Batch Coloring of Graphs
- Dynamic coloring on restricted graph classes
- Deterministic graph coloring in the streaming model
- Minimum order of graphs with given coloring parameters
- New potential functions for greedy independence and coloring
- ACODYGRA: An agent algorithm for coloring dynamic graphs
- Dynamic Edge Coloring with Improved Approximation
- Dynamic list coloring of 1-planar graphs
This page was built for publication: Dynamic coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883161)