On bags and bugs

Berge, 1973

Berman, 2001, On the spectral radius of graphs with cut vertices, J. Combin. Theory Ser. B, 83, 233, 10.1006/jctb.2001.2052

Bollobás, 1978

Brualdi, 1986, On the spectral radius of complementary acyclic matrices of zero and ones, SIAM J. Algebraic Discrete Methods, 7, 265, 10.1137/0607030

Caporossi, 2000, Variable neighborhood search for extremal Graphs, I. The AutoGraphiX system, Discrete Math., 212, 29, 10.1016/S0012-365X(99)00206-X

Caporossi, 2004, Variable neighborhood search for extremal graphs. V. Three ways to automate finding conjectures, Discrete Math., 276, 81, 10.1016/S0012-365X(03)00311-X

Cvetković, 1995

Cvetković, 2004, On some interconnections between combinatorial optimization and extremal graph theory, Yugoslav J. Oper. Res., 14, 147, 10.2298/YJOR0402147C

Cvetković, 2001, Variable neighborhood search for extremal graphs. III. On the largest eigenvalue of color-constrained trees, Linear and Multilinear Algebra, 49, 143, 10.1080/03081080108818690

Harary, 1976, Anticritical graphs, Math. Proc. Cambridge Philos. Soc., 79, 11, 10.1017/S0305004100052051

Mladenović, 1997, Variable neighborhood search, Comput. Oper. Res., 24(11), 1097, 10.1016/S0305-0548(97)00031-2

A. Schwenk, How to compute characteristic polynomial of a graph? Lecture Notes in Mathematics, vol. 406, 1974, pp. 45–51.

Belardo, 2006, Some results on the index of unicyclic graphs, Linear Algebra Appl., 416, 1048, 10.1016/j.laa.2006.01.008

Vizing, 1967, On the number of edges in a graph with given radius, Dokl. Akad. Nauk. SSSR, 173, 1245