Queue Layouts of Graphs with Bounded Degree and Bounded Genus
share
We prove that graphs with bounded degree and bounded Euler genus have bounded queue-number. As a byproduct we prove that if planar graphs have bounded queue-number (which is an open problem), then graphs of Euler genus g have queue-number O(g).
READ FULL TEXT