Inequalities between the domination number and the chromatic number of a graph

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Upper bounds for σ+χ and σχ are proved, where σ is the dominationnumber and χ the chromatic number of a graph. © 1989.

Cite

CITATION STYLE

APA

Gernert, D. (1989). Inequalities between the domination number and the chromatic number of a graph. Discrete Mathematics, 76(2), 151–153. https://doi.org/10.1016/0012-365X(89)90308-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free