The following pages link to Algorithms and Computation (Q5712175):
Displaying 10 items.
- On the max-weight edge coloring problem (Q613668) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- NP‐completeness of list coloring and precoloring extension on the edges of planar graphs (Q5311921) (← links)
- On the Max Coloring Problem (Q5443379) (← links)