Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

ENDM
2006

favoriteEmaildiscussreport

127views more ENDM 2006»

Greedy defining sets in graphs and Latin squares

13 years 6 months ago

Greedy defining sets in graphs and Latin squares

Download www.iasbs.ac.ir

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.

Manouchehr Zaker

Real-time Traffic

ENDM 2006 | Graph G | Greedy | Greedy Algorithm |

claim paper

Related Content

» Greedy Defining Sets in Latin Squares

» Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges

» Amorphic association schemes with negative Latin squaretype graphs

» Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints

» A combinatorial theorem on labeling squares with points and its application

» Delaunay graphs of point sets in the plane with respect to axisparallel rectangles

» Recovering the LongRange Links in Augmented Graphs

» On the FirstFit Chromatic Number of Graphs

» FaultTolerant kFold Pivot Routing in Wireless Sensor Networks

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	ENDM
Authors	Manouchehr Zaker

Comments (0)