On sum coloring of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4154469 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1163713 (Why is no real title available?)
- An O(EV\log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
- Computing the Minimum Fill-In is NP-Complete
- Minimal coloring and strength of graphs
- Minimum Color Sum of Bipartite Graphs
- NP completeness of finding the chromatic index of regular graphs
- Node-Deletion Problems on Bipartite Graphs
- On chromatic sums and distributed resource allocation
- On sum coloring of graphs
- The NP-Completeness of Edge-Coloring
- Tight bounds on the chromatic sum of a connected graph
Cited in
(39)- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
- Minimum sum coloring problem: upper bounds for the chromatic strength
- Coloring the Cartesian sum of graphs
- The transportation problem with conflicts
- The chromatic sum of a graph: history and recent developments
- A note on the strength and minimum color sum of bipartite graphs
- Polynomial algorithm for finding chromatic sum for unicyclic and outerplanar graphs.
- Minimum sum multicoloring on the edges of trees
- Lower bounds for the minimal sum coloring problem
- An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
- ILP models and column generation for the minimum sum coloring problem
- On the performance guarantee of first fit for sum coloring
- Sum coloring of bipartite graphs with bounded degree
- Edge-chromatic sum of trees and bounded cyclicity graphs
- The complexity of chromatic strength and chromatic edge strength
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Chromatic Edge Strength of Some Multigraphs
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
- The minimum color sum of bipartite graphs
- On sum edge-coloring of regular, bipartite and split graphs
- On the minimum sum coloring of P₄-sparse graphs
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
- An improved bi-criteria evolutionary approach for the sum coloring of graphs
- Minimum sum set coloring of trees and line graphs of trees
- Max-optimal and sum-optimal labelings of graphs
- On sum edge-colorings of complete tripartite graphs
- STACS 2004
- An improved bi-criteria evolutionary approach for the sum coloring of graphs
- An exact algorithm for the minimum sum coloring problem on partially decomposable graphs
- Minimum sum edge colorings of multicycles
- Complexity results for minimum sum edge coloring
- A strict strong coloring of trees
- Generalised colouring sums of graphs
- Chromatic cost coloring of weighted bipartite graphs
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- On sum coloring of graphs
- An effective heuristic algorithm for sum coloring of graphs
- A branch-and-price algorithm for the minimum sum coloring problem
- Minimum sum coloring of \(P_{4}\)-sparse graphs
This page was built for publication: On sum coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811069)
