Results 1  10
of
32
Boundeddegree graphs have arbitrarily large geometric thickness
, 2008
"... The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In Towards a Theory of Geometric Graphs, vol. 342 of Contemp. Math., AMS, 200 ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In Towards a Theory of Geometric Graphs, vol. 342 of Contemp. Math., AMS, 2004] asked whether every graph of bounded maximum degree has bounded geometric thickness. We answer this question in the negative, by proving that there exists ∆regular graphs with arbitrarily large geometric thickness. In particular, for all ∆ ≥ 9 and for all large n, there exists a ∆regular graph with geometric thickness at least c √ ∆n 1/2−4/∆−ǫ. Analogous results concerning graph drawings with few edge slopes are also presented, thus solving open problems by Dujmović et al. [Really straight graph drawings. In Proc. 12th
Graph Treewidth and Geometric Thickness Parameters
 DISCRETE AND COMPUTATIONAL GEOMETRY
, 2005
"... Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph parameter thickness. By restricting the edges to be straight, we obtain the geometric thickness. By additionally restri ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph parameter thickness. By restricting the edges to be straight, we obtain the geometric thickness. By additionally restricting the vertices to be in convex position, we obtain the book thickness. This paper studies the relationship between these parameters and treewidth. Our first main result states that for graphs of treewidth k, the maximum thickness and the maximum geometric thickness both equal ⌈k/2⌉. This says that the lower bound for thickness can be matched by an upper bound, even in the more restrictive geometric setting. Our second main result states that for graphs of treewidth k, the maximum book thickness equals k if k ≤ 2 and equals k + 1 if k ≥ 3. This refutes a conjecture of Ganley and Heath [Discrete Appl. Math. 109(3):215–221, 2001]. Analogous results are proved for outerthickness, arboricity, and stararboricity.
Binary labelings for plane quadrangulations and their relatives
, 2007
"... Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder’s one for tr ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder’s one for triangulations: Apart from being in bijection with tree decompositions, paths in these trees allow to define the regions of a vertex such that counting faces in them yields an algorithm for embedding the quadrangulation, in this case on a 2book. Furthermore, as Schnyder labelings have been extended to 3connected plane graphs, we are able to extend our labeling from quadrangulations to a larger class of 2connected bipartite graphs.
Really straight graph drawings
 Proc. 12th International Symp. on Graph Drawing (GD ’04
, 2004
"... We study straightline drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2trees, and planar 3trees. We prove that every 3connected plane graph on n vertices has a plane drawing with at most 5n/2 segme ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We study straightline drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2trees, and planar 3trees. We prove that every 3connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes. We prove that every cubic 3connected plane graph has a plane drawing with three slopes (and three bends on the outerface). Drawings of nonplanar graphs with few slopes are also considered. For example, interval graphs, cocomparability graphs and ATfree graphs are shown to have have drawings in which the number of slopes is bounded by the maximum degree. We prove that graphs of bounded degree and bounded treewidth have drawings with O(log n) slopes. Finally we prove that every graph has a drawing with one bend per edge, in which the number of slopes is at most one more than the
Partitions of Complete Geometric Graphs into Plane Trees
 IN 12TH INTERNATIONAL SYMPOSIUM ON GRAPH DRAWING (GD ’04
, 2006
"... Consider the open problem: does every complete geometric graph K 2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directions. First, we study the case of convex geometric graphs. It is well known that the complete convex graph K 2n has a partition ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Consider the open problem: does every complete geometric graph K 2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directions. First, we study the case of convex geometric graphs. It is well known that the complete convex graph K 2n has a partition into n plane spanning trees. We characterise all such partitions. Second, we give a sufficient condition, which generalises the convex case, for a complete geometric graph to have a partition into plane spanning trees. Finally, we consider a relaxation of the problem in which the trees of the partition are not necessarily spanning. We prove that every complete geometric graph Kn can be partitioned into at most n n/12 plane trees.
CHARACTERISATIONS AND EXAMPLES OF GRAPH CLASSES WITH BOUNDED EXPANSION
"... Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Neˇsetˇril and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a shallow minor of a graph in the class is bounded by a function of t ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Neˇsetˇril and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a shallow minor of a graph in the class is bounded by a function of the depth of the shallow minor. Several lineartime algorithms are known for bounded expansion classes (such as subgraph isomorphism testing), and they allow restricted homomorphism dualities, amongst other desirable properties. In this paper we establish two new characterisations of bounded expansion classes, one in terms of socalled topological parameters, the other in terms of controlling dense parts. The latter characterisation is then used to show that the notion of bounded expansion is compatible with ErdösRényi model of random graphs with constant average degree. In particular, we prove that for every fixed d> 0, there exists a class with bounded expansion, such that a random graph of order n and edge probability d/n asymptotically almost surely belongs to the class. We then present several new examples of classes with bounded expansion that do not exclude some topological minor, and appear naturally in the context of graph drawing or graph colouring. In particular, we prove that the following classes have bounded expansion: graphs that can be drawn in the plane with a bounded number of crossings per edge, graphs with bounded stack number, graphs with bounded queue number, and graphs with bounded nonrepetitive chromatic number. We also prove that graphs with ‘linear ’ crossing number are contained in a topologicallyclosed class, while graphs with bounded crossing number are contained in a minorclosed class.
ThreeDimensional 1Bend Graph Drawings
 Concordia University
, 2004
"... We consider threedimensional griddrawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum volume of such a drawing is Θ(cn), where n is the number of vertices and c is the cutwidth of the graph. We then prove that ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider threedimensional griddrawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum volume of such a drawing is Θ(cn), where n is the number of vertices and c is the cutwidth of the graph. We then prove that every graph has a threedimensional griddrawing with O(n 3 / log 2 n) volume and one bend per edge. The best previous bound was O(n 3).
The 2page crossing number of Kn
, 2011
"... Around 1958, Hill conjectured that the crossing number cr(Kn) of the complete graph Kn is Z (n): = 1 n n−1 n−2 n−3 4 2 2 2 2 and provided drawings of Kn with exactly Z(n) crossings. Towards the end of the century, substantially different drawings of Kn with Z(n) crossings were found. These drawings ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Around 1958, Hill conjectured that the crossing number cr(Kn) of the complete graph Kn is Z (n): = 1 n n−1 n−2 n−3 4 2 2 2 2 and provided drawings of Kn with exactly Z(n) crossings. Towards the end of the century, substantially different drawings of Kn with Z(n) crossings were found. These drawings are 2page book drawings, that is, drawings where all the vertices are on a line ℓ (the spine) and each edge is fully contained in one of the two halfplanes (pages) defined by ℓ. The2page crossing number of Kn, denoted by ν2(Kn), is the minimum number of crossings determined by a 2page book drawing of Kn. It was generally conjectured that cr(Kn) =Z(n) and since cr(Kn) ≤ ν2(Kn) ≤ Z(n), the conjecture ν2(Kn) =Z(n) appeared as a milestone in the way to find the correct values of cr(Kn). In this paper we develop a novel and innovative technique to investigate crossings in drawings of Kn, and use it to prove that ν2(Kn) =Z(n). To this end, we extend the inherent geometric definition of kedges for finite sets of points in the plane to topological drawings of Kn. We also introduce the concept of ≤≤kedges as a useful generalization of ≤kedges. Finally, we extend a powerful theorem that expresses the number of crossings in a rectilinear drawing of Kn in terms of its number of kedges to the topological setting. 1 1
On the Queue Number of Planar Graphs
, 2010
"... We prove that planar graphs have O(log 4 n) queue number, thus improving upon the previous O ( √ n) upper bound. Consequently, planar graphs admit 3D straightline crossingfree grid drawings in O(n log c n) volume, for some constant c, thus improving upon the previous O(n 3/2) upper bound. 2 1 ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We prove that planar graphs have O(log 4 n) queue number, thus improving upon the previous O ( √ n) upper bound. Consequently, planar graphs admit 3D straightline crossingfree grid drawings in O(n log c n) volume, for some constant c, thus improving upon the previous O(n 3/2) upper bound. 2 1
Layouts of Graph Subdivisions
, 2004
"... A kstack layout (respectively, kqueue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of noncrossing (nonnested) edges with respect to the vertex ordering. A ktrack layout of a graph consists of a vertex kcolouring, and a total order of e ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A kstack layout (respectively, kqueue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of noncrossing (nonnested) edges with respect to the vertex ordering. A ktrack layout of a graph consists of a vertex kcolouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The stacknumber (respectively, queuenumber, tracknumber) of a graph G, denoted by sn(G) (qn(G), tn(G)), is the minimum k such that G has a kstack (kqueue, ktrack) layout. This paper studies stack, queue, and track layouts of graph subdivisions. It is known that every graph has a 3stack subdivision. The best known upper bound on the number of division vertices per edge in a 3stack subdivision of an nvertex graph G is improved from O(log n) to O(log min{sn(G), qn(G)}). This result reduces the question of whether queuenumber is bounded by stacknumber to whether 3stack graphs have bounded queue number. It is proved that every graph has a 2queue subdivision, a 4track subdivision, and a mixed 1stack 1queue subdivision. All these values are optimal for every nonplanar graph. In addition, we characterise those graphs with kstack, kqueue, and ktrack subdivisions, for all values of k. The number of division vertices per edge in the case of 2queue and 4track subdivisions, namely O(log qn(G)), is optimal to within a constant factor, for every graph G. Applications to 3D polyline grid drawings are presented. For example, it is proved that every graph G has a 3D polyline grid drawing with the vertices on a rectangular prism, and with O(log qn(G)) bends per edge.