Pages that link to "Item:Q286971"
From MaRDI portal
The following pages link to A coloring problem for weighted graphs (Q286971):
Displaying 16 items.
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- On the max coloring problem (Q690449) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
- On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
- Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results (Q3181046) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
