The book crossing number of a graph

DOI10.1002/(SICI)1097-0118(199604)21:4%3C413::AID-JGT7%3E3.0.CO;2-SMaRDI QIDQ4879178zbMATH OpenOpenAlexFDO

Authors Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o

Publication date 29 October 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199604)21:4%3C413::aid-jgt7%3E3.0.co;2-s

zbMATH Keywords

approximation algorithmsbook crossing numberrectiliner crossing number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page
• Crossing numbers of graphs
• Improved lower bounds on book crossing numbers of complete graphs
• Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine

Cited in

(21)

• scientific article; zbMATH DE number 7236457 (Why is no real title available?)
• Crossing number, pair-crossing number, and expansion
• On book crossing numbers of the complete graph
• On \(k\)-planar crossing numbers
• scientific article; zbMATH DE number 969978 (Why is no real title available?)
• Crossing numbers of graphs
• Algorithms for the fixed linear crossing number problem
• Stack-number is not bounded by queue-number
• The 2-page crossing number of \(K_{n}\)
• Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation
• Book embeddings and crossing numbers
• One- and two-page crossing numbers for some types of graphs
• An analysis of some linear graph layout heuristics
• Approximating the fixed linear crossing number
• Experimental evaluation of book drawing algorithms
• Crossing Minimisation Heuristics for 2-page Drawings
• Book embeddings of regular graphs
• On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page
• Book drawings of complete bipartite graphs
• The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
• Graph classes and forbidden patterns on three vertices

This page was built for publication: The book crossing number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879178)