Skip to main content
SpringerLink
Log in

On the Crossing Number of 2-Page Book Drawings of \(K_{n}\) with Prescribed Number of Edges in Each Page

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We consider the problem of determining the 2-page book crossing number of the complete graph \( K_n \) when the number of edges in each page is given. We find upper and lower bounds of the right order of magnitude depending on the number of edges in the page with the least number of edges.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Kainen, P.C.: The book thickness of a graph II. Congressus Numerantium 71, 121–132 (1990)

    MathSciNet  MATH  Google Scholar 

  2. Six, J. M., Tollis, I. G.: Circular drawings of biconnected graphs. In: Proc. Workshop on Algorithm Engineering and Experimentation (ALENEX99), pp. 57–73. Springer, LNCS (1999)

  3. Cimikowski, R., Mumey, B.: Approximating the fixed linear crossing number. Discrete Appl. Math. 155, 2202–2210 (2007)

    Article  MathSciNet  Google Scholar 

  4. Bilski, T.: Embeddings graphs in books: a survey. IEEE Proc. Comput. Digit. Tech. 139, 134–138 (1992)

    Article  Google Scholar 

  5. Dujmović, V., Wood, D.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6, 339–358 (2004)

    MathSciNet  MATH  Google Scholar 

  6. Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to vsli design. SIAM J. Algebraic Discrete Math. 8, 33–58 (1987)

    Article  Google Scholar 

  7. Damiani, E., D’Antona, O., Salemi, P.: An upper bound to the crossing number of the complete graph drawn on the pages of a book. J. Comb. Inf. Syst. Sci. 19, 75–84 (1994)

    MathSciNet  MATH  Google Scholar 

  8. de Klerk, E., Pasechnik, D.V., Salazar, G.: Improved lower bounds on book crossing numbers of complete graphs. SIAM J. Discrete Math. 27, 619–633 (2012)

    Article  MathSciNet  Google Scholar 

  9. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrt’o, I.: The book crossing number of a graph. J. Graph Theory 21, 413–424 (1996)

    Article  MathSciNet  Google Scholar 

  10. Ábrego, B. M., Aichholzer, O., Fernández-Merchant, S., Ramos, P., Salazar, G.: The \(2\)-page crossing number of \(K_n\). In: 28th Ann. ACM Symp., pp. 397–403. Computational Geometry. Chapel Hill, NC, USA (2012)

  11. Ábrego, B.M., Aichholzer, O., Fernández-Merchant, S., Ramos, P., Salazar, G.: The 2-page crossing number of \(K_{n}\). Discrete Comput. Geom. 49–4, 747–777 (2013)

    Article  Google Scholar 

  12. Harary, F., Hill, A.: On the number of crossings in a complete graph. Proc. Edinb. Math. Soc. 13, 333–338 (1963)

    Article  MathSciNet  Google Scholar 

  13. Beineke, L., Wilson, R.: The early history of the brick factory problem. Math. Intell. 32, 41–48 (2010)

    Article  MathSciNet  Google Scholar 

  14. Blažek, J., Koman, M.: A minimal problem concerning complete plane graphs. In: Fiedler, M. (ed.) Theory of Graphs and its Applications, pp. 113–117. Czech Academy of Science, Prague (1964)

    MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the referees for their useful comments and corrections.

Author information

Authors and Affiliations

  1. California State University, Northridge, 18111 Nordhoff St., Northridge, CA, 91330-8313, USA

    Bernardo Ábrego & Silvia Fernández-Merchant

  2. Berlin Mathematical School, TU Berlin, Sekr. MA 2-2 Strasse des 17. Juni 136, 10623, Berlin, Germany

    Evgeniya Lagoda

  3. Universidad de Alcalá, Apdo. de Correos 20, 28871, Alcalá de Henares, Madrid, Spain

    Pedro Ramos

Authors
  1. Bernardo Ábrego
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Silvia Fernández-Merchant
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Evgeniya Lagoda
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pedro Ramos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernardo Ábrego.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This research was partially supported by NSF Grant DMS-1400653.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ábrego, B., Fernández-Merchant, S., Lagoda, E. et al. On the Crossing Number of 2-Page Book Drawings of \(K_{n}\) with Prescribed Number of Edges in Each Page . Graphs and Combinatorics 36, 303–318 (2020). https://doi.org/10.1007/s00373-019-02077-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-019-02077-4

Keywords

Search

Navigation