The following pages link to (Q3483299):
Displayed 14 items.
- Total colorings of graphs with minimum sum of colors (Q503645) (← links)
- Cost colourings of hypergraphs (Q878618) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- On the cost-chromatic number of graphs (Q1363702) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- On sum coloring of graphs (Q1811069) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- Comparison of sum choice number with chromatic sum (Q2032707) (← links)
- Total chromatic sum for trees (Q2056882) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- Tabular graphs and chromatic sum (Q2576829) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)