Some upper bounds for the product of the domination number and the chromatic number of a graph

DOI10.1016/0012-365X(93)90074-4zbMath0782.05049MaRDI QIDQ685554

Lutz Volkmann, Jerzy Topp

Publication date: 4 January 1994

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

zbMATH Keywords

upper boundschromatic numberregular graphminimum degreeconnected graphdomination number

Mathematics Subject Classification ID

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

Related Items (1)

Relations between the lower domination parameters and the chromatic number of a graph.

Cites Work

• Estimations for the domination number of a graph
• Inequalities between the domination number and the chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some upper bounds for the product of the domination number and the chromatic number of a graph