On the Grundy Number of a Graph

被引：0
|
作者：
Havet, Frederic [1 ]
Sampaio, Leonardo [1 ]
机构：
[1] UNSA, CNRS, I3S, Projet Mascotte, F-06902 Sophia Antipolis, France
来源：
PARAMETERIZED AND EXACT COMPUTATION | 2010年 / 6478卷
关键词：
Colouring; Online Colouring; Greedy Colouring; NP-completeness; Fixed Parameter Complexity;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The Grundy number of a graph G, denoted by Gamma(G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm according to some ordering of the vertices of G. Trivially Gamma(G) <= Delta(G) + 1. In this paper, we show that deciding if Gamma(G) <= Delta(G) is NP-complete. We then show that deciding if Gamma(G) >= vertical bar V(G)vertical bar - k is fixed parameter tractable with respect to the parameter k.
引用
收藏
页码：170 / 179
页数：10
相关论文
共 50 条
  • [31] On Grundy and b-Chromatic Number of Some Families of Graphs: A Comparative Study
    Zoya Masih
    Manouchehr Zaker
    Graphs and Combinatorics, 2021, 37 : 605 - 620
  • [32] On the detour number and geodetic number of a graph
    Chartrand, G
    Johns, GL
    Zhang, P
    ARS COMBINATORIA, 2004, 72 : 3 - 15
  • [33] On Grundy and b-Chromatic Number of Some Families of Graphs: A Comparative Study
    Masih, Zoya
    Zaker, Manouchehr
    GRAPHS AND COMBINATORICS, 2021, 37 (02) : 605 - 620
  • [34] On the family of r-regular graphs with Grundy number r+1
    Gastineau, Nicolas
    Kheddouci, Hamamache
    Togni, Olivier
    DISCRETE MATHEMATICS, 2014, 328 : 5 - 15
  • [35] The eavesdropping number of a graph
    Jeffrey L. Stuart
    Czechoslovak Mathematical Journal, 2009, 59 : 623 - 636
  • [36] ON THE SEPARATION NUMBER OF A GRAPH
    MILLER, Z
    PRITIKIN, D
    NETWORKS, 1989, 19 (06) : 651 - 666
  • [37] The Convexity Number of a Graph
    Gary Chartrand
    Curtiss E. Wall
    Ping Zhang
    Graphs and Combinatorics, 2002, 18 : 209 - 217
  • [38] On the geodetic number of a graph
    Chartrand, G
    Harary, F
    Zhang, P
    NETWORKS, 2002, 39 (01) : 1 - 6
  • [39] On the Annihilation Number of a Graph
    Pepper, Ryan
    PROCEEDINGS OF THE 15TH AMERICAN CONFERENCE ON APPLIED MATHEMATICS AND PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL AND INFORMATION SCIENCES 2009, VOLS I AND II, 2009, : 217 - +
  • [40] THE HULL NUMBER OF A GRAPH
    EVERETT, MG
    SEIDMAN, SB
    DISCRETE MATHEMATICS, 1985, 57 (03) : 217 - 223
12345