Pages that link to "Item:Q1974540"
From MaRDI portal
The following pages link to Minimal coloring and strength of graphs (Q1974540):
Displaying 23 items.
- Contractions and minimal k-colorability (Q916670) (← links)
- A note on the strength and minimum color sum of bipartite graphs (Q967294) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- On sum coloring of graphs (Q1811069) (← links)
- Minimax relations for the partial q-colorings of a graph (Q1825878) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Minimum degree conditions for the strength and bandwidth of graphs (Q2166226) (← 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)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- Tabular graphs and chromatic sum (Q2576829) (← links)
- Weakly completable critical sets for proper vertex and edge colourings of graphs (Q2760455) (← links)
- A tabu search approach for the sum coloring problem (Q2861511) (← links)
- (Q3004823) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
- Graphs with least number of colorings (Q4842706) (← links)
- (Q4871063) (← links)
- A Result on the Strength of Graphs by Factorizations of Complete Graphs (Q5051422) (← links)
- (Q5331780) (← links)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)
