Pages that link to "Item:Q1421509"

The following pages link to Relations between the lower domination parameters and the chromatic number of a graph. (Q1421509):

Displaying 13 items.

• Some upper bounds for the product of the domination number and the chromatic number of a graph (Q685554) (← links)
• \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
• A strict strong coloring of trees (Q989572) (← links)
• On the ratios between packing and domination parameters of a graph (Q1025506) (← links)
• Inequalities between the domination number and the chromatic number of a graph (Q1121277) (← links)
• Dominated colorings of graphs (Q2345536) (← links)
• On some domination colorings of graphs (Q2399288) (← links)
• New parameters involving chromatic sum in a graph (Q2839241) (← links)
• Irredundance (Q3384112) (← links)
• Relations between the domination parameters and the chromatic index of a graph (Q3560786) (← links)
• On strict strong coloring of graphs (Q5013494) (← links)
• On the double total dominator chromatic number of graphs (Q5101880) (← links)
• Total domination, separated-cluster, CD-coloring: algorithms and hardness (Q6547920) (← links)