| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653158 | Electronic Notes in Discrete Mathematics | 2006 | 4 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
