AbstractThis paper studies the game chromatic number and game colouring number of the square of graphs. In particular, we prove that if G is a forest of maximum degree Δ≥9, then χg(G2)≤colg(G2)≤Δ+3, and there are forests G with colg(G2)=Δ+3. It is also proved that for an outerplanar graph G of maximum degree Δ, χg(G2)≤colg(G2)≤2Δ+14, and for a planar graph G of maximum degree Δ, χg(G2)≤colg(G2)≤23Δ+75
AbstractGiven a graph G and an integer k, two players alternatively color the edges of G using k col...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
Given a graph G = (V;E), two players, Alice and Bob, alternate their turns in choosing uncoloured ve...
AbstractThe game coloring number of the square of a graph G, denoted by gcol(G2), was first studied ...
AbstractThis paper discusses the game colouring number of partial k-trees and planar graphs. Let col...
International audienceGiven a graph G = (V;E), two players, Alice and Bob, alternate their turns in ...
AbstractThis paper discusses a variation of the game chromatic number of a graph: the game coloring ...
AbstractLet f be a graph function which assigns to each graph H a non-negative integer f(H)≤|V(H)|. ...
AbstractIn a circular r-colouring game on G, Alice and Bob take turns colouring the vertices of G wi...
AbstractGiven a graph G and a positive integer p, χp(G) is the minimum number of colours needed to c...
AbstractSuppose G=(V,E) is a graph and F is a colouring of its edges (not necessarily proper) that u...
AbstractIn a circular r-colouring game on G, Alice and Bob take turns colouring the vertices of G wi...
AbstractWe study edge coloring games defining the so-called game chromatic index of a graph. It has ...
AbstractThis paper introduces a new strategy for playing the marking game on graphs. Using this stra...
The vertex coloring game is a two-player game on a graph with given color set in which the first pla...
AbstractGiven a graph G and an integer k, two players alternatively color the edges of G using k col...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
Given a graph G = (V;E), two players, Alice and Bob, alternate their turns in choosing uncoloured ve...
AbstractThe game coloring number of the square of a graph G, denoted by gcol(G2), was first studied ...
AbstractThis paper discusses the game colouring number of partial k-trees and planar graphs. Let col...
International audienceGiven a graph G = (V;E), two players, Alice and Bob, alternate their turns in ...
AbstractThis paper discusses a variation of the game chromatic number of a graph: the game coloring ...
AbstractLet f be a graph function which assigns to each graph H a non-negative integer f(H)≤|V(H)|. ...
AbstractIn a circular r-colouring game on G, Alice and Bob take turns colouring the vertices of G wi...
AbstractGiven a graph G and a positive integer p, χp(G) is the minimum number of colours needed to c...
AbstractSuppose G=(V,E) is a graph and F is a colouring of its edges (not necessarily proper) that u...
AbstractIn a circular r-colouring game on G, Alice and Bob take turns colouring the vertices of G wi...
AbstractWe study edge coloring games defining the so-called game chromatic index of a graph. It has ...
AbstractThis paper introduces a new strategy for playing the marking game on graphs. Using this stra...
The vertex coloring game is a two-player game on a graph with given color set in which the first pla...
AbstractGiven a graph G and an integer k, two players alternatively color the edges of G using k col...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
Given a graph G = (V;E), two players, Alice and Bob, alternate their turns in choosing uncoloured ve...
DOI
Add to ORKG