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

DOI10.1016/S0012-365X(03)00093-1zbMath1037.05036OpenAlexW1993060679MaRDI QIDQ1421509

Mustapha Chellali, Lutz Volkmann

Publication date: 26 January 2004

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00093-1

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

On some domination colorings of graphs ⋮ On the double total dominator chromatic number of graphs ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ A strict strong coloring of trees ⋮ Irredundance ⋮ On strict strong coloring of graphs ⋮ Dominated colorings of graphs

Cites Work

• Some upper bounds for the product of the domination number and the chromatic number of a graph
• Inequalities between the domination number and the chromatic number of a graph
• The product of the independent domination numbers of a graph and its complement
• Extremal graphs for a new upper bound on domination parameters in graphs
• Properties of Hereditary Hypergraphs and Middle Graphs
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item