Pages that link to "Item:Q3832591"
From MaRDI portal
The following pages link to Tight bounds on the chromatic sum of a connected graph (Q3832591):
Displaying 15 items.
- Cost colourings of hypergraphs (Q878618) (← links)
- Contractions and minimal k-colorability (Q916670) (← links)
- On the cost-chromatic number of graphs (Q1363702) (← links)
- The color cost of a caterpillar (Q1377806) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- On sum coloring of graphs (Q1811069) (← links)
- A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- Tabular graphs and chromatic sum (Q2576829) (← links)
- (Q2861511) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
