The color cost of a caterpillar

DOI10.1016/S0012-365X(96)00325-1zbMath0887.05018MaRDI QIDQ1377806

Mario Gionfriddo, Zsolt Tuza, Frank Harary

Publication date: 6 May 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

caterpillarcolour cost

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Combinatorial aspects of the sensor location problem ⋮ MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES ⋮ The b-chromatic number of power graphs of complete caterpillars ⋮ Sum coloring and interval graphs: A tight upper bound for the minimum number of colors

Cites Work

• Contractions and minimal k-colorability
• Parallel concepts in graph theory
• The number of caterpillars
• Tight bounds on the chromatic sum of a connected graph
• Trees with Hamiltonian square
• Unnamed Item

This page was built for publication: The color cost of a caterpillar