Pages that link to "Item:Q503645"
From MaRDI portal
The following pages link to Total colorings of graphs with minimum sum of colors (Q503645):
Displaying 14 items.
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- Colorings at minimum cost (Q960968) (← 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)
- Total chromatic sum for trees (Q2056882) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- Tabular graphs and chromatic sum (Q2576829) (← links)
- (Q3004823) (← links)
- Graphs that require many colors to achieve their chromatic sum (Q3483299) (← links)
- Tight bounds on the chromatic sum of a connected graph (Q3832591) (← links)
- Coloring of trees with minimum sum of colors (Q4719325) (← links)
- Graphs with least number of colorings (Q4842706) (← links)
- (Q4871063) (← links)
- On the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs (Q5123461) (← links)