The following pages link to Dynamic coloring of graphs (Q2883161):
Displaying 18 items.
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- Dynamic list coloring of bipartite graphs (Q608280) (← links)
- On the dynamic coloring of graphs (Q617650) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Dynamic list coloring of 1-planar graphs (Q2659245) (← links)
- (Q2936711) (← links)
- Batch Coloring of Graphs (Q2971156) (← links)
- (Q4607872) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- The structure and the list 3-dynamic coloring of outer-1-planar graphs (Q5024667) (← links)
- Dynamic Edge Coloring with Improved Approximation (Q5236303) (← links)
- A MODEL OF GRAPH COLORING DYNAMICS WITH ATTENTION WAVES AND STRATEGIC WAITING (Q5851783) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Dynamic coloring on restricted graph classes (Q6057319) (← links)
- Deterministic graph coloring in the streaming model (Q6083483) (← links)