[1] Bodlaender, H. L.: Some classes of graphs with bounded treewidth. Bull. EATCS 36, 116-126 (1988)
[2] Boyd, S. and Vandenberghe, L.: Convex optimization. Cambridge University Press (2004)
[3] Chartrand, G. and Harary, F.: Planar permutation graphs. Annales de l’I.H.P. Probabilit´es et statistiques. 3, 433-438 (1967)
[4] Chung, F. R. K., Kostant, B. and Sternberg, S.: Groups and the buckyball. Lie Theory and Geometry, Progress in Mathematics. 123, 97-126 (1994)
[5] Chung, F. R. K. and Mumford, D.: Chordal completions of planar graphs. J. Comb. Theory. 62(1), 96-106 (1994)
[6] Feit, W. and Higman, G.: The nonexistence of certain generalized polygons. J. Algebra. 1, 114-131 (1964)
[7] Fiedler, M.: Laplacian of graphs and algebraic connectivity. Combinatorics and Graph Theory. 25, 57-70 (1989)
[8] Gomyou, T.: The rotational dimension of a graph containing a clique. Graphs and Combinatorics (2019) (under submission)
[9] Gomyou, T., Kobayashi, T., Kondo, T. and Nayatani, S.: Optimal embedding and spectral gap of a finite graph. arXiv:2002.03584v1 [math.CO] (2020)
[10] G¨oring, F., Helmberg, C. and Wappler, M.: Embedded in the shadow of the separator. SIAM J. Optim. 19(1), 472-501 (2008)
[11] G¨oring, F., Helmberg, C. and Wappler, M.: The rotational dimension of a graph. J. Graph Theory. 66(4), 283-302 (2011)
[12] Heggernes, P.: Treewidth, partial k-trees, and chordal graphs. Partial curriculum in INF334 - Advanced algorithmical techniques, Department of Informatics, University of Bergen, Norway (2005)
[13] Helmberg, C.: Semidefinite programming for combinatorial optimization. ZIBReport 00-34, Berlin (2000) Habilitationsschrift.
[14] Izeki, H. and Nayatani, S.: Combinatorial harmonic maps and discrete-group actions on Hadamard spaces. Geom. Dedicata. 114, 147-188 (2005)
[15] Ivrissimtzis, I. and Peyerimhoff, N.: Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups. Groups, geometry, and dynamics. 7, 591-615 (2013)
[16] Kawarabayashi, K and Mohar, B.: Some recent progress and applications in graph minor theory. Graphs Combin. 23(1), 1-46 (2007)
[17] Koster, Arie M. C. A., Bodlaender, Hans L. and Hoesel, Stan P.M. van. Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics. 8, 54-57 (2001)
[18] Padrol-Sureda, A. and Pfeifle, J.: Graph operations and Laplacian eigenpolytopes. VII Jornadas de Matem´atica Discreta y Algor´ıtmica, 505-516 (2010)
[19] Robertson, N., Seymour, P. and Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B. 62, 323-348 (1994)
[20] Roger A. Horn and Charles R. Johnson.: Matrix analysis. Cambridge University Press, Cambridge (1985)
[21] Van der Holst, H., Laurent, M. and Schrijver, A.: On a minor-monotone graph invariant. J. Comb. Theory. 65(2), 291-304 (1995)
[22] Van der Holst, H., Lov´asz, L. and Schrijver, A.: The Colin de Verdi`ere graph parameter. Graph Theory and Combinatorial Biology. 29-85. J´anos Bolyai Mathematical Society. Budapest (1999)
[23] Wagner, K.: Uber eine Eigenschaft der ebenen Komplexe. Math. Ann. 114, 570-590 (1937)
[24] Wappler, M.: On graph embeddings and a new minor monotone graph parameter associated with the algebraic connectivity of a graph. dissertation, Fakult¨at f¨ur Mathematik, Technische Universit¨at Chemnitz (2013)
論文の公開元へ
