Queue Layout of Bipartite Graph Subdivisions

  • Authors:

  • Miki Miyauchi

  • Affiliations:

  • -

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

For an integer d 0, a d-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into d sets of non-nested edges with respect to the vertex ordering. Recently V. Dujmović and D. R. Wood showed that for every integer d ≥ 2, every graph G has a d-queue layout of a subdivision of G with 2⌈logdqn(G)⌉ + 1 division vertices per edge, where qn(G) is the queue number of G. This paper improves the result for the case of a bipartite graph, and shows that for every integer d ≥ 2, every bipartite graph Gm,n has a d-queue layout of a subdivision of Gm,n with ⌈logdn⌉-1 division vertices per edge, where m and n are numbers of vertices of the partite sets of Gm,n (m ≥ n).