Contractions and minimal k-colorability

DOI10.1007/BF01787480zbMATH Open0704.05017MaRDI QIDQ916670FDOQ916670

Authors: Zsolt Tuza 

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• Coloring of trees with minimum sum of colors
• A note on the strength and minimum color sum of bipartite graphs
• Minimal coloring and strength of graphs
• scientific article; zbMATH DE number 4154469
• Chromatic Edge Strength of Some Multigraphs

zbMATH Keywords

contractionstrengthchromatic summinimal coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Tight bounds on the chromatic sum of a connected graph

Cited In (7)

• Contraction, k-deficit, and the coloring of hypergraphs
• The complexity of chromatic strength and chromatic edge strength
• The color cost of a caterpillar
• Optimal guard sets and the Helly property
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Comparison of sum choice number with chromatic sum
• Sum coloring and interval graphs: A tight upper bound for the minimum number of colors

This page was built for publication: Contractions and minimal k-colorability

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