Greedy defining sets in graphs and Latin squares

Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring results in a minimum coloring of an order graph G. In this note we report some of the previous results as well as new results on greedy defining sets of graphs and Latin squares.

• Type: Journal
• Year: 2006
• Where: ENDM
• Authors: Manouchehr Zaker
• Keywords: ENDM 2006, Graph G, Greedy, Greedy Algorithm