scientific article; zbMATH DE number 4154469

zbMATH Open0704.05020MaRDI QIDQ3483299FDOQ3483299

Authors: Ewa Kubicka, Allen J. Schwenk, P. Erdős 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• Tabular graphs and chromatic sum
• Tight bounds on the chromatic sum of a connected graph
• Coloring of trees with minimum sum of colors
• Certain chromatic sums of some cycle-related graph classes
• Total colorings of graphs with minimum sum of colors

zbMATH Keywords

chromatic sum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (18)

• Tight bounds on the chromatic sum of a connected graph
• Tabular graphs and chromatic sum
• Chromatic Edge Strength of Some Multigraphs
• On sum edge-coloring of regular, bipartite and split graphs
• Cost colourings of hypergraphs
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Comparison of sum choice number with chromatic sum
• Contractions and minimal k-colorability
• Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
• On the cost-chromatic number of graphs
• Chromatic sums for colorings avoiding monochromatic subgraphs
• A note on chromatic sum.
• Minimum sum edge colorings of multicycles
• Improper sum-list colouring of 2-trees
• New variable neighborhood search method for minimum sum coloring problem on simple graphs
• Total colorings of graphs with minimum sum of colors
• Total chromatic sum for trees
• On sum coloring of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3483299)