Pages that link to "Item:Q4719325"
From MaRDI portal
The following pages link to Coloring of trees with minimum sum of colors (Q4719325):
Displaying 19 items.
- Total colorings of graphs with minimum sum of colors (Q503645) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- The complexity of chromatic strength and chromatic edge strength (Q853645) (← links)
- Minimally colored trees (Q908876) (← links)
- Contractions and minimal k-colorability (Q916670) (← links)
- A note on the strength and minimum color sum of bipartite graphs (Q967294) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- The chromatic sum of a graph: history and recent developments (Q1774775) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- Minimal coloring and strength of graphs (Q1974540) (← links)
- Total chromatic sum for trees (Q2056882) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Tabular graphs and chromatic sum (Q2576829) (← links)
- Coloring \(k\)-trees with forbidden monochrome or rainbow triangles (Q2820201) (← links)
- Graphs that require many colors to achieve their chromatic sum (Q3483299) (← links)
- (Q5091252) (← links)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)
- Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)
