Pages that link to "Item:Q1774775"
From MaRDI portal
The following pages link to The chromatic sum of a graph: history and recent developments (Q1774775):
Displayed 24 items.
- Total colorings of graphs with minimum sum of colors (Q503645) (← links)
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- A note on the strength and minimum color sum of bipartite graphs (Q967294) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Multicoloring trees. (Q1401922) (← links)
- On the performance guarantee of first fit for sum coloring (Q1628787) (← links)
- Online sum-paintability: the slow-coloring game (Q1699554) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- Tabular graphs and chromatic sum (Q2576829) (← links)
- Certain chromatic sums of some cycle-related graph classes (Q2821116) (← links)
- A study on the injective coloring parameters of certain graphs (Q2821118) (← links)
- New parameters involving chromatic sum in a graph (Q2839241) (← links)
- Minimum Sum Coloring of P4-sparse graphs (Q2840552) (← links)
- (Q2861511) (← links)
- Batch Coloring of Graphs (Q2971156) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- On certain coloring parameters of Mycielski graphs of some graphs (Q4554560) (← links)
- (Q5071868) (← links)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)
