Contents

Ars Combinatoria

  • Research article

Improved Bounds for the Product of the Domination and Chromatic Numbers of a Graph

Y. Caro1, Y. Roditty2
1Department of Mathematics School of Education University of Haifa – ORANIM Tivon Isreal 36006
2School of Mathematical Sciences Tel-Aviv University Ramat- Aviv, Tel-Aviv Isreal 69978
  • Published: 31/07/2000

Abstract

In this note we solve almost completely a problem raised by Topp and Volkmann [7] concerning the product of the domination and the chromatic numbers of a graph.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Y. Caro, Y. Roditty. Improved Bounds for the Product of the Domination and Chromatic Numbers of a Graph[J], Ars Combinatoria, Volume 056. 189-191. DOI: .