We prove that planar graphs have O(log(2) n) queue number, thus improving upon the previous O(root n) upper bound. Consequently, planar graphs admit three-dimensional straight-line crossing-free grid drawings in O(n log(8) n) volume, thus improving upon the previous O(n(3/2)) upper bound
We prove that any planar graph on n vertices has less than O(5.2852n) spanning trees. Under the rest...
Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line d...
AbstractLet Pn be the set of labelled planar graphs with n vertices. Denise, Vasconcellos and Welsh ...
We prove that planar graphs have polylogarithmic queue number, thus improving upon the previous poly...
We prove that planar graphs have O(log2 n) queue number, thus improving upon the previous O(Formula ...
A famous result due to de Fraysseix, Pach, and Pollack [Combinatorica, 1990] and Schnyder [Order, 19...
A queue layout of a graph consists of a linear order of its vertices and a partition of its edges in...
Abstract. A k-queue layout of a graph consists of a total order of the vertices, and a partition of ...
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges in...
14 pages, 10 figures, Appears in the Proceedings of the 26th International Symposium on Graph Drawin...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
We introduce a new method to optimize the required area, minimum angle and number of bends of planar...
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applic...
We prove that any planar graph on n vertices has less than O(5.2852n) spanning trees. Under the rest...
Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line d...
AbstractLet Pn be the set of labelled planar graphs with n vertices. Denise, Vasconcellos and Welsh ...
We prove that planar graphs have polylogarithmic queue number, thus improving upon the previous poly...
We prove that planar graphs have O(log2 n) queue number, thus improving upon the previous O(Formula ...
A famous result due to de Fraysseix, Pach, and Pollack [Combinatorica, 1990] and Schnyder [Order, 19...
A queue layout of a graph consists of a linear order of its vertices and a partition of its edges in...
Abstract. A k-queue layout of a graph consists of a total order of the vertices, and a partition of ...
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges in...
14 pages, 10 figures, Appears in the Proceedings of the 26th International Symposium on Graph Drawin...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
We introduce a new method to optimize the required area, minimum angle and number of bends of planar...
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applic...
We prove that any planar graph on n vertices has less than O(5.2852n) spanning trees. Under the rest...
Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line d...
AbstractLet Pn be the set of labelled planar graphs with n vertices. Denise, Vasconcellos and Welsh ...
DOI
Add to ORKG