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

DOI10.1016/0012-365X(89)90308-7zbMath0674.05030MaRDI QIDQ1121277

Dieter Gernert

Publication date: 1989

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

zbMATH Keywords

regular graphschromatic numberdomination numberconnected graphscomplementarity relationfinite simple graph

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (8)

On the domination number of cross products of graphs ⋮ Coefficient of domination in graph ⋮ Relations between the lower domination parameters and the chromatic number of a graph. ⋮ Some upper bounds for the product of the domination number and the chromatic number of a graph ⋮ Inequalities with respect to graph homomorphism ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• On graphs having domination number half their order
• On Complementary Graphs
• A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inequalities between the domination number and the chromatic number of a graph