scholarly journals New Bounds on the Grundy Number of Products of Graphs

2012 ◽  
Vol 71 (1) ◽  
pp. 78-88 ◽  
Author(s):  
Victor Campos ◽  
András Gyárfás ◽  
Frédéric Havet ◽  
Claudia Linhares Sales ◽  
Frédéric Maffray
Keyword(s):  
Grundy Number

scholarly journals Grundy Number of Some Chordal Graphs

2018 ◽  
Vol 7 (4.10) ◽  
pp. 64
Author(s):  
R. Nagarathinam ◽  
N. Parvathi ◽  
. .
Keyword(s):  
Line Graph ◽  
Cartesian Product ◽  
Chordal Graphs ◽  
Complete Graphs ◽  
Proper Coloring ◽  
Coloring Problem ◽  
Grundy Number

For a given graph G and integer k, the Coloring problem is that of testing whether G has a k-coloring, that is, whether there exists a vertex mapping c : V → {1, 2, . . .} such that c(u) 12≠"> c(v) for every edge uv ∈ E. For proper coloring, colors assigned must be minimum, but for Grundy coloring which should be maximum. In this instance, Grundy numbers of chordal graphs like Cartesian product of two path graphs, join of the path and complete graphs and the line graph of tadpole have been executed 

scholarly journals A note on the Grundy number and graph products

2016 ◽  
Vol 202 ◽  
pp. 1-7 ◽  
Author(s):  
Nancy E. Clarke ◽  
Stephen Finbow ◽  
Shannon Fitzpatrick ◽  
Margaret-Ellen Messinger ◽  
Rebecca Milley ◽  
...  
Keyword(s):  
Graph Products ◽  
Grundy Number

scholarly journals On the Grundy number of Cameron graphs

2017 ◽  
Vol 63 ◽  
pp. 503-516
Author(s):  
Wing-Kai Hon ◽  
Ton Kloks ◽  
Fu-Hong Liu ◽  
Hsiang-Hsuan Liu ◽  
Tao-Ming Wang
Keyword(s):  
Grundy Number

scholarly journals A lower bound for approximating the Grundy number

2007 ◽  
Vol Vol. 9 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Guy Kortsarz
Keyword(s):  
Lower Bound ◽  
Grundy Number ◽  
International Audience ◽  
On Line

Graphs and Algorithms International audience The grundy numbering of a graph is the maximum number of colors used by on-line first-fit coloring, under the worst order of arrival of vertices. The grundy numbering problem is to find this ordering. We prove that there is a constant c>1 so that approximating the grundy numbering problem within c is not possible, unless NP ⊆ RP

scholarly journals On the Grundy number of graphs with few P4’s

2012 ◽  
Vol 160 (18) ◽  
pp. 2514-2522 ◽  
Author(s):  
J. Araujo ◽  
C. Linhares Sales
Keyword(s):  
Grundy Number

scholarly journals Grundy number and products of graphs

2010 ◽  
Vol 310 (9) ◽  
pp. 1482-1490 ◽  
Author(s):  
Marie Asté ◽  
Frédéric Havet ◽  
Claudia Linhares-Sales
Keyword(s):  
Grundy Number

scholarly journals Grundy number of graphs

2007 ◽  
Vol 27 (1) ◽  
pp. 5 ◽  
Author(s):  
Brice Effantin ◽  
Hamamache Kheddouci
Keyword(s):  
Grundy Number
Sign in / Sign up

Export Citation Format

Share Document