Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...