ENDM   2006
Wall of Fame | Most Viewed ENDM-2006 Paper
127views more  ENDM 2006»
10 years 6 months ago
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 resul...
Manouchehr Zaker
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source127
2Download preprint from source119
3Download preprint from source96
4Download preprint from source91
5Download preprint from source83
6Download preprint from source77
7Download preprint from source75
8Download preprint from source74
9Download preprint from source73
10Download preprint from source70
11Download preprint from source69
12Download preprint from source69
13Download preprint from source68
14Download preprint from source65
15Download preprint from source61
16Download preprint from source58
17Download preprint from source57
18Download preprint from source57
19Download preprint from source53
20Download preprint from source50