Skip to main content
SpringerLink
Log in

On Mixed Linear Layouts of Series-Parallel Graphs

  • Conference paper
  • First Online:
Graph Drawing and Network Visualization (GD 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12590))

Included in the following conference series:

  • 579 Accesses

Abstract

A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same stack cross and no two edges in the same queue nest. In 1992, Heath and Rosenberg conjectured that every planar graph admits a mixed 1-stack 1-queue layout. Recently, Pupyrev disproved this conjectured by demonstrating a planar partial 3-tree that does not admit a 1-stack 1-queue layout. In this note, we strengthen Pupyrev’s result by showing that the conjecture does not hold even for 2-trees, also known as series-parallel graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: On dispersable book embeddings. In: Brandstädt, A., Köhler, E., Meer, K. (eds.) WG. LNCS, vol. 11159, pp. 1–14. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00256-5_1

  2. Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Queue layouts of planar 3-trees. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 213–226. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-04414-5_15

    Chapter  Google Scholar 

  3. Angelini, P., Bekos, M.A., Kindermann, P., Mchedlidze, T.: On mixed linear layouts of series-parallel graphs. CoRR abs/2008.10475v2 (2020). http://arxiv.org/abs/2008.10475v2

  4. Bannister, M.J., Devanny, W.E., Dujmović, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica (2018). https://doi.org/10.1007/s00453-018-0487-5

  5. Bekos, M.A., Gronemann, M., Raftopoulou, C.N.: Two-page book embeddings of 4-planar graphs. Algorithmica 75(1), 158–185 (2016). https://doi.org/10.1007/s00453-015-0016-8

    Article  MathSciNet  MATH  Google Scholar 

  6. Bekos, M.A., Kaufmann, M., Klute, F., Pupyrev, S., Raftopoulou, C.N., Ueckerdt, T.: Four pages are indeed necessary for planar graphs. J. Comput. Geom. 11(1), 332–353 (2020). https://journals.carleton.ca/jocg/index.php/jocg/article/view/504

  7. Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory Ser. B 27(3), 320–331 (1979). https://doi.org/10.1016/0095-8956(79)90021-2

  8. Binucci, C., Di Giacomo, E., Hossain, M.I., Liotta, G.: 1-page and 2-page drawings with bounded number of crossings per edge. Eur. J. Comb. 68, 24–37 (2018). https://doi.org/10.1016/j.ejc.2017.07.009

    Article  MathSciNet  MATH  Google Scholar 

  9. Cornuéjols, G., Naddef, D., Pulleyblank, W.R.: Halin graphs and the travelling salesman problem. Math. Program. 26(3), 287–294 (1983). https://doi.org/10.1007/BF02591867

    Article  MathSciNet  MATH  Google Scholar 

  10. de Col, P., Klute, F., Nöllenburg, M.: Mixed linear layouts: complexity, heuristics, and experiments. In: Archambault, D., Tóth, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 460–467. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-35802-0_35

    Chapter  MATH  Google Scholar 

  11. Di Battista, G., Frati, F., Pach, J.: On the queue number of planar graphs. SIAM J. Comput. 42(6), 2243–2285 (2013). https://doi.org/10.1137/130908051

    Article  MathSciNet  MATH  Google Scholar 

  12. Dujmović, V.: Graph layouts via layered separators. J. Comb. Theory Ser. B 110, 79–89 (2015). https://doi.org/10.1016/j.jctb.2014.07.005

    Article  MathSciNet  MATH  Google Scholar 

  13. Dujmović, V., Frati, F.: Stack and queue layouts via layered separators. J. Graph Algorithms Appl. 22(1), 89–99 (2018). https://doi.org/10.7155/jgaa.00454

    Article  MathSciNet  MATH  Google Scholar 

  14. Dujmović, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. In: Zuckerman, D. (ed.) FOCS. pp. 862–875. IEEE Computer Society (2019). https://doi.org/10.1109/FOCS.2019.00056

  15. Dujmović, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theoret. Comput. Sci. 6(2), 339–358 (2004). http://dmtcs.episciences.org/317

  16. Ewald, G.: Hamiltonian circuits in simplicial complexes. Geometriae Dedicata 2(1), 115–125 (1973). https://doi.org/10.1007/BF00149287

    Article  MathSciNet  MATH  Google Scholar 

  17. de Fraysseix, H., de Mendez, P.O., Pach, J.: A left-first search algorithm for planar graphs. Discrete Comput. Geometry 13, 459–468 (1995). https://doi.org/10.1007/BF02574056

    Article  MathSciNet  MATH  Google Scholar 

  18. Guan, X., Yang, W.: Embedding planar 5-graphs in three pages. Discret. Appl. Math. (2019). https://doi.org/10.1016/j.dam.2019.11.020

  19. Heath, L.S.: Embedding planar graphs in seven pages. In: FOCS, pp. 74–83. IEEE Computer Society (1984). https://doi.org/10.1109/SFCS.1984.715903

  20. 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). https://doi.org/10.1137/0405031

    Article  MathSciNet  MATH  Google Scholar 

  21. Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927–958 (1992). https://doi.org/10.1137/0221055

    Article  MathSciNet  MATH  Google Scholar 

  22. Hoffmann, M., Klemz, B.: Triconnected planar graphs of maximum degree five are subhamiltonian. In: Bender, M.A., Svensson, O., Herman, G. (eds.) ESA. LIPIcs, vol. 144, pp. 58:1–58:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019). https://doi.org/10.4230/LIPIcs.ESA.2019.58

  23. Kainen, P.C., Overbay, S.: Extension of a theorem of Whitney. Appl. Math. Lett. 20(7), 835–837 (2007). https://doi.org/10.1016/j.aml.2006.08.019

    Article  MathSciNet  MATH  Google Scholar 

  24. Nishizeki, T., Chiba, N.: Hamiltonian cycles. In: Planar Graphs: Theory and Algorithms, chap. 10, pp. 171–184. Dover Books on Mathematics, Courier Dover Publications (2008)

    Google Scholar 

  25. Pupyrev, S.: Mixed linear layouts of planar graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 197–209. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73915-1_17

    Chapter  Google Scholar 

  26. Rengarajan, S., Veni Madhavan, C.E.: Stack and queue number of 2-trees. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 203–212. Springer, Heidelberg (1995). https://doi.org/10.1007/BFb0030834

    Chapter  Google Scholar 

  27. Wiechert, V.: On the queue-number of graphs with bounded tree-width. Electr. J. Comb. 24(1), P1.65 (2017). http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p65

  28. Yannakakis, M.: Four pages are necessary and sufficient for planar graphs (extended abstract). In: Hartmanis, J. (ed.) ACM Symposium on Theory of Computing, pp. 104–108. ACM (1986). https://doi.org/10.1145/12130.12141

  29. Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38(1), 36–67 (1989). https://doi.org/10.1016/0022-0000(89)90032-9d

    Article  MathSciNet  MATH  Google Scholar 

  30. Yannakakis, M.: Planar graphs that need four pages. CoRR abs/2005.14111 (2020). https://arxiv.org/abs/2005.14111

Download references

Author information

Authors and Affiliations

  1. John Cabot University, Rome, Italy

    Patrizio Angelini

  2. Universität Tübingen, Tübingen, Germany

    Michael A. Bekos

  3. Universität Würzburg, Würzburg, Germany

    Philipp Kindermann

  4. Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany

    Tamara Mchedlidze

  5. Universität Passau, Passau, Germany

    Michael A. Bekos & Philipp Kindermann

Authors
  1. Patrizio Angelini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael A. Bekos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Philipp Kindermann
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tamara Mchedlidze
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael A. Bekos .

Editor information

Editors and Affiliations

  1. LaBRI, University of Bordeaux, Talence, France

    David Auber

  2. Charles University, Prague, Czech Republic

    Pavel Valtr

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Angelini, P., Bekos, M.A., Kindermann, P., Mchedlidze, T. (2020). On Mixed Linear Layouts of Series-Parallel Graphs. In: Auber, D., Valtr, P. (eds) Graph Drawing and Network Visualization. GD 2020. Lecture Notes in Computer Science(), vol 12590. Springer, Cham. https://doi.org/10.1007/978-3-030-68766-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-68766-3_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-68765-6

  • Online ISBN: 978-3-030-68766-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation