## On the Queue Number of Planar Graphs (2010)

by
Fabrizio Frati
,
János Pach

Citations: | 3 - 0 self |

### BibTeX

@MISC{Frati10onthe,

author = {Fabrizio Frati and János Pach},

title = {On the Queue Number of Planar Graphs},

year = {2010}

}

### OpenURL

### Abstract

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 straight-line 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