Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way Read chapter Read first chapter

2004 | OriginalPaper | Chapter

Bounds and Methods for k-Planar Crossing Numbers

Authors : Farhad Shahrokhi, Ondrej Sýkora, Laszlo A. Székely, Imrich Vrt’o

Published in: Graph Drawing

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

The k-planar crossing number of a graph is the minimum number of crossings of its edges over all possible drawings of the graph in k planes. We propose algorithms and methods for k-planar drawings of general graphs together with lower bound techniques. We give exact results for the k-planar crossing number of K2 k + 1, q, for k ≥ 2. We prove tight bounds for complete graphs.

previous chapter Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm
next chapter How Many Ways Can One Draw a Graph?
Metadata
Title
Bounds and Methods for k-Planar Crossing Numbers
Authors
Farhad Shahrokhi
Ondrej Sýkora
Laszlo A. Székely
Imrich Vrt’o
Copyright Year
2004
Publisher
Springer Berlin Heidelberg
Book
Graph Drawing

Print ISBN: 978-3-540-20831-0

Electronic ISBN: 978-3-540-24595-7

Copyright Year: 2004

DOI
https://doi.org/10.1007/978-3-540-24595-7_4

Premium Partner

    Image Credits