Pages that link to "Item:Q1702844"
From MaRDI portal
The following pages link to Computational aspects of greedy partitioning of graphs (Q1702844):
Displaying 12 items.
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Graph classes generated by Mycielskians (Q2194538) (← links)
- (Q2753729) (← links)
- (Q3575418) (← links)
- (Q3748301) (← links)
- (Q3821604) (← links)
- On the computational complexity of (O,P)-partition problems (Q4210668) (← links)
- (Q4886052) (← links)
- Generalized Coloring of Permutations (Q5009614) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- Generalized coloring of permutations (Q6582372) (← links)