Lombardi Drawings of Graphs

We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.Comment: Expanded version of paper appearing in the 18th International Symposium on Graph Drawing (GD 2010). 13 pages, 7 figure

The Weisfeiler-Leman Dimension of Planar Graphs is at most 3

We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best known upper bounds for the dimension and number of variables were 14 and 15, respectively. First we show that, for dimension 3 and higher, the WL-algorithm correctly tests isomorphism of graphs in a minor-closed class whenever it determines the orbits of the automorphism group of any arc-colored 3-connected graph belonging to this class. Then we prove that, apart from several exceptional graphs (which have WL-dimension at most 2), the individualization of two correctly chosen vertices of a colored 3-connected planar graph followed by the 1-dimensional WL-algorithm produces the discrete vertex partition. This implies that the 3-dimensional WL-algorithm determines the orbits of a colored 3-connected planar graph. As a byproduct of the proof, we get a classification of the 3-connected planar graphs with fixing number 3.Comment: 34 pages, 3 figures, extended version of LICS 2017 pape

Phase diagram of the chromatic polynomial on a torus

We study the zero-temperature partition function of the Potts antiferromagnet (i.e., the chromatic polynomial) on a torus using a transfer-matrix approach. We consider square- and triangular-lattice strips with fixed width L, arbitrary length N, and fully periodic boundary conditions. On the mathematical side, we obtain exact expressions for the chromatic polynomial of widths L=5,6,7 for the square and triangular lattices. On the physical side, we obtain the exact ``phase diagrams'' for these strips of width L and infinite length, and from these results we extract useful information about the infinite-volume phase diagram of this model: in particular, the number and position of the different phases.Comment: 72 pages (LaTeX2e). Includes tex file, three sty files, and 26 Postscript figures. Also included are Mathematica files transfer6_sq.m and transfer6_tri.m. Final version to appear in Nucl. Phys.

An extensive English language bibliography on graph theory and its applications, supplement 1

Graph theory and its applications - bibliography, supplement