We characterize the toroidal graphs with no K3,3-subdivisions as canonical compositions in which 2-pole planar networks are substituted for the edges of non-planar cores. This str...
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 resul...
In this note, we prove the uniqueness of the one-point extension S of a generalized hexagon of order 2 and prove the non-existence of such an extension S of any other finite gener...
Hans Cuypers, A. De Wispelaere, Hendrik Van Maldeg...
In this paper, we study the representation of W(2) in PG(2, 4) related to a hyperoval. We provide a group-theoretic characterization and some geometric ones.
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...