A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Planar Graphs of Bounded Degree have Constant Queue Number
[article]
2019
arXiv
pre-print
Preserved Fulltext
Other Versions
We prove that planar graphs of bounded degree (which may have unbounded treewidth) have bounded queue number. ...
edge) of bounded degree has bounded queue number. ...
Wood for pointing out an issue in an earlier version of this paper and the anonymous referees of both the journal and the conference version of this paper for their valuable comments and suggestions. ...
arXiv:1811.00816v3
fatcat:2cd65psucfe6znckdq7yps4bdm
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
., 2001], who ask whether graphs of bounded tree-width have bounded queue-number? ...
The minimum number of queues in a queue layout of a graph is its queue-number. Let be an Ò-vertex member of a proper minor-closed family of graphs (such as a planar graph). ...
That is, graphs of bounded tree-width have bounded queue-number, and hence have three-dimensional drawings with linear volume. ...
doi:10.1007/3-540-36206-1_31
fatcat:mgvakktkh5dc7jdvby4oqnjyly
Book Embeddings of Graph Products
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We show that the stack number is bounded for the strong product of a path and (i) a graph of bounded pathwidth or (ii) a bipartite graph of bounded treewidth and bounded degree. ...
The stack number (book thickness, page number) of a graph is the minimum k such that it admits a k-stack layout. ...
[2] , yield a constant upper bound on the queue number of planar graphs. ...
arXiv:2007.15102v1
fatcat:hpjrwfbyvvbtbg54hbes3wdbhe
The Local Queue Number of Graphs with Bounded Treewidth
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We present tools to bound the local queue number of graphs from above and below, focusing on graphs of treewidth k. ...
Our results imply, inter alia, that the maximum local queue number among planar graphs is either 3 or 4. ...
As the maximum average degree of planar graphs is strictly smaller than 6 and 2-trees are planar, Theorems 2 and 4 bound the maximum local queue number of the class of planar graphs. Corollary 6. ...
arXiv:2008.05392v1
fatcat:my4zz5s5dvau3a3ifbbao5xfwm
Layouts of Graph Subdivisions
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This result reduces the question of whether queue-number is bounded by stack-number to whether 3-stack graphs have bounded queue number. ...
The stack-number (respectively, queue-number, track-number ) of a graph G, denoted by sn(G) (qn(G), tn(G)), is the minimum k such that G has a k-stack (k-queue, k-track) layout. ...
Thanks to Franz Brandenburg and Ulrik Brandes for pointing out the connection to double-ended queues. ...
doi:10.1007/978-3-540-31843-9_15
fatcat:kp3lauk55fhi3hibpfllpwnqta
Planar graphs have bounded queue-number
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. ...
Building on this work and using the graph minor structure theorem, we prove that every proper minor-closed class of graphs has bounded queue-number. ...
Analogues of Theorems 36 and 37 have been proved for bounded degree graphs in any minor-closed class [46] and for k-planar graphs and several other non-minor-closed classes of interest [51] . ...
arXiv:1904.04791v5
fatcat:pugxgwurwzcu5p3egrt45vx66u
Queue Layouts of Graphs with Bounded Degree and Bounded Genus
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Motivated by the question of whether planar graphs have bounded queue-number, we prove that planar graphs with maximum degree Δ have queue-number O(Δ^2), which improves upon the best previous bound of ...
As a byproduct we prove that if planar graphs have bounded queue-number, then graphs of Euler genus g have queue-number O(g). ...
We improve their bound and more generally show that graphs with bounded degree and bounded genus have bounded queue-number. ...
arXiv:1901.05594v2
fatcat:665twqppirgk7dhp7kubxi4gji
Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seaminar 19092)
2019
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Next we discussed open research problems about beyond planar graphs, such as their combinatorial structures (e.g., book thickness, queue number), their topology (e.g., simultaneous embeddability, gap planarity ...
This report documents the program and the outcomes of Dagstuhl Seminar 19092 "Beyond-Planar Graphs: Combinatorics, Models and Algorithms" which brought together 36 researchers in the areas of graph theory ...
We thank Günter Rote and Martin Gronemann for asking interesting questions that led to some of this research. ...
doi:10.4230/dagrep.9.2.123
dblp:journals/dagstuhl-reports/Hong0PT19
fatcat:pvtbranvp5fwfkaul2nlmb6m4e
Page 9208 of Mathematical Reviews Vol. , Issue 2004k
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We prove that graphs with bounded path-width, or both bounded tree-width and bounded maximum degree, have bounded queue-number. ...
Math. 109 (2001), no. 3, 215-221; MR 2001m:05085], who asked whether graphs of bounded tree- width have bounded queue-number. ...
Characterisations and examples of graph classes with bounded expansion
2012
European journal of combinatorics (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
bounded queue number, and graphs with bounded non-repetitive chromatic number. ...
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 ...
Acknowledgements The authors would like to thank Vida Dujmović for simplifying a clumsy proof in an early draft of the paper. ...
doi:10.1016/j.ejc.2011.09.008
fatcat:x5pwnkcy4zhvpjbyhwgljgcvaq
Planar Graphs have Bounded Queue-Number
2019
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. ...
Building on this work and using the graph minor structure theorem, we prove that every proper minor-closed class of graphs has bounded queue-number. ...
Acknowledgements This research was completed at the 7th Annual Workshop on Geometry and Graphs held at Bellairs Research Institute in March 2019. ...
doi:10.1109/focs.2019.00056
dblp:conf/focs/DujmovicJMMUW19
fatcat:rjzi6x2xwbaq7kkbj4pqni377m
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
2005
Discrete Mathematics & Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This result reduces the question of whether queue-number is bounded by stack-number to whether 3-stack graphs have bounded queue number. ...
\par It is proved that every graph has a 2-queue subdivision, a 4-track subdivision, and a mixed 1-stack 1-queue subdivision. All these values are optimal for every non-planar graph. ...
Thanks to Franz Brandenburg and Ulrik Brandes for pointing out the connection to double-ended queues. Thanks to Ferran Hurtado and Prosenjit Bose for graciously hosting the second author. ...
doi:10.46298/dmtcs.346
fatcat:olvfxbq3ozgapla2gms6we5srm
On Linear Layouts of Graphs
2004
Discrete Mathematics & Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
What is the maximum chromatic number of a graph admitting each type of layout? What is the computational complexity of recognising the graphs that admit each type of layout? ...
\par In addition, we survey the following fundamental questions regarding each type of layout, and in the case of queue layouts, provide simple proofs of a number of existing results. ...
Planar graphs have arch-number at most three and this bound is tight. Proof. The Four Colour Theorem and Theorem 1 imply that all planar graphs have arch-number at most three. ...
doi:10.46298/dmtcs.317
fatcat:jpk5edn4szchdpsbkxpcqmzw6e
Layouts of Expander Graphs
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible. ...
By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. ...
Acknowledgement This research was initiated at the Workshop on Graphs and Geometry held at the Bellairs Research Institute in 2014. Thanks to the referee for the above observation. ...
arXiv:1501.05020v3
fatcat:7v6nw5xizvgvxphqi3yipgrkeq
Graph product structure for non-minor-closed classes
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:1907.05168v3 fatcat:tvtfpac7i5hnjhckq4zhafqhf4Other Versions
It implies, amongst other results, that k-planar graphs have non-repetitive chromatic number upper-bounded by a function of k. ...
ACM '20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. ...
bounds on the queue-number of map graphs. ...
arXiv:1907.05168v4
fatcat:up4bm7ozlbebvetozvedvw7tiu
« Previous
Showing results 1 — 15 out of 2,578 results