Contractions and minimal k-colorability

DOI10.1007/BF01787480zbMath0704.05017MaRDI QIDQ916670

Zsolt Tuza

Publication date: 1990

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

zbMATH Keywords

contractionstrengthchromatic summinimal coloring

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

• Tight bounds on the chromatic sum of a connected graph
• Unnamed Item
• Unnamed Item

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