OFFSET
3,2
COMMENTS
The first 10 terms were obtained by filtering the list of non-isomorphic connected graphs, see McKay et al., 2013.
LINKS
J. A. MacDougall and R. B. Eggleton, Triangle-free and triangle-saturated Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 25:3-21, 1997.
B. D. McKay and A. Piperno, Practical Graph Isomorphism, II, J. Symbolic Computation 60 (2013), 94-112.
EXAMPLE
The diameter-2-critical graphs for n=3,4,5 are K_{1,2}; K_{1,3}, C_4; K_{1,4}, K_{2,3}, C_5.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Miodrag Zivkovic, Dec 17 2019
STATUS
approved