Gunnar Brinkmann All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:129-140 [Journal]
A. W. F. Edwards Seven-Set Venn Diagrams with Rotational and Polar Symmetry. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:149-152 [Journal]
András Lukács On Local Expansion of Vertex-Transitive Graphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:205-209 [Journal]
Michele Mosca Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:211-216 [Journal]