Minimum Color Sum of Bipartite Graphs
From MaRDI portal
Recommendations
Cited in
(37)- Complexity results for minimum sum edge coloring
- Multicoloring trees.
- A matched approximation bound for the sum of a greedy coloring
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- On the performance guarantee of first fit for sum coloring
- An effective heuristic algorithm for sum coloring of graphs
- On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application
- On sum coloring of graphs
- Sum coloring of bipartite graphs with bounded degree
- Minimum sum coloring problem: upper bounds for the chromatic strength
- On sum edge-coloring of regular, bipartite and split graphs
- A short proof of the NP-completeness of minimum sum interval coloring
- On the probabilistic minimum coloring and minimum k-coloring
- Minimum cost homomorphisms with constrained costs
- Minimum sum coloring of \(P_{4}\)-sparse graphs
- Lower bounds for the minimal sum coloring problem
- Edge-chromatic sum of trees and bounded cyclicity graphs
- scientific article; zbMATH DE number 5904019 (Why is no real title available?)
- Sum edge coloring of multigraphs via configuration LP
- Sum coloring of distance and circulant graphs
- Chromatic Edge Strength of Some Multigraphs
- Approximation results for the optimum cost chromatic partition problem
- The minimum color sum of bipartite graphs
- A General Framework for Approximating Min Sum Ordering Problems
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
- The probabilistic minimum coloring problem (extended abstract)
- Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs
- Minimum sum set coloring of trees and line graphs of trees
- An improved bi-criteria evolutionary approach for the sum coloring of graphs
- An improved bi-criteria evolutionary approach for the sum coloring of graphs
- Chromatic cost coloring of weighted bipartite graphs
- Concurrency constrained scheduling with tree-like constraints
- On the minimum sum coloring of P₄-sparse graphs
- On sum coloring and sum multi-coloring for restricted families of graphs
- The transportation problem with conflicts
- A note on the strength and minimum color sum of bipartite graphs
- Minimum sum edge colorings of multicycles
This page was built for publication: Minimum Color Sum of Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209269)
