Skip to main content
SpringerLink
Log in

Characterization of Level Non-planar Graphs by Minimal Patterns

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1858))

Included in the following conference series:

Abstract

In this paper we give a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar subgraph patterns (MLNP). We show that a MLNP is completely characterized by either a tree, a level non-planar cycle or a level planar cycle with certain path augmentations. These characterizations are an important first step towards attacking the \( \mathcal{N}\mathcal{P} \) -hard level planarization problem.

Funded by Forbairt Basic Research Grant SC/97/611.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Di Battista and E. Nardelli. Hierarchies and planarity theory. IEEE Transactions on Systems, Man, and Cybernetics, 18(6):1035–1046, 1988.

    Article  MATH  Google Scholar 

  2. P. Eades, B. D. McKay, and N. C. Wormald. On an edge crossing problem. In Proc. 9th Australian Computer Science Conference, pages 327–334. Australian National University, 1986.

    Google Scholar 

  3. P. Eades and S. Whitesides. Drawing graphs in two layers. Theoretical Computer Science, 131:361–374, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. F. Harary. Graph Theory. Addison-Wesley, 1969.

    Google Scholar 

  5. M. Jünger, S. Leipert, and P. Mutzel. Level planarity testing in linear time. Technical Report 98.321, Institut für Informatik, Universität zu Köln, 1998.

    Google Scholar 

  6. P. Mutzel. An alternative method to crossing minimization on hierarchical graphs. In Stephen North, Ed, Graph Drawing. Symposium on Graph Drawing, GD’ 96, volume 1190 of Lecture Notes in Computer Science, pages 318–333. Springer-Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Comp. Science and Info. Systems, University of Limerick, Ireland

    Patrick Healy & Ago Kuusik

  2. Institut für Informatik, Universität zu Köln, Germany

    Sebastian Leipert

Authors
  1. Patrick Healy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ago Kuusik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sebastian Leipert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, MN 55455, Minneapolis, USA

    Ding-Zhu Du

  2. Department of Computer Science and Software Engineering, University of Newcastle, Callaghan, NSW 2308, Australia

    Peter Eades  & Vladimir Estivill-Castro  & 

  3. School of Computer Science and Engineering, University of Newcastle, NSW 2052, Sydney, Australia

    Xuemin Lin  & Arun Sharma  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Healy, P., Kuusik, A., Leipert, S. (2000). Characterization of Level Non-planar Graphs by Minimal Patterns. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44968-X_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67787-1

  • Online ISBN: 978-3-540-44968-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation