The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...