scientific article; zbMATH DE number 4154469

MaRDI QIDQ3483299zbMATH OpenFDO

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

Publication date 1990

zbMATH Keywords

chromatic sum

Mathematics Subject Classification ID

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

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

Cited in

(18)

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

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)