Abstract
A (3,2)-track layout of a graph G consists of a 2-track assignment of G and an edge 3-coloring of G with no monochromatic X-crossing. This paper studies the problem of (3,2)-track layout of bipartite graph subdivisions. Recently Dujmović and Wood showed that every graph G with n vertices has a (3,2)-track subdivision of G with 4 ⌈logqn(G) ⌉ + 3 division vertices per edge, where qn(G) is the queue number of G. This paper improves their result for the case of complete bipartite graphs, and shows that every complete bipartite graph K m,n has a (3,2)-track subdivision of K m,n with 2 ⌈logqn(K m,n) ⌉ + 1 division vertices per edge, where m and n are numbers of vertices of the partite sets of K m,n with m ≥ n.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dujmović, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. 34(3), 553–579 (2005)
Dujmović, V., Wood, D.R.: Stacks, queues and tracks: Layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci. 7, 155–202 (2005)
Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math. 5(3), 398–412 (1992)
Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927–958 (1992)
Wood, D.R.: Queue layouts of graph products and powers. Discrete Math. Theor. Comput. Sci. 7(1), 255–268 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyauchi, M. (2008). (3,2)-Track Layout of Bipartite Graph Subdivisions. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds) Computational Geometry and Graph Theory. KyotoCGGT 2007. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89550-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-89550-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89549-7
Online ISBN: 978-3-540-89550-3
eBook Packages: Computer ScienceComputer Science (R0)