The book crossing number of a graph

DOI<413::AID-JGT7>3.0.CO;2-S 10.1002/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.0.CO;2-SzbMath0851.05045OpenAlexW2023858337MaRDI QIDQ4879178

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

Publication date: 29 October 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199604)21:4<413::aid-jgt7>3.0.co;2-s

zbMATH Keywords

approximation algorithmsbook crossing numberrectiliner crossing number

Mathematics Subject Classification ID

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

Related Items (16)

Algorithms for the fixed linear crossing number problem ⋮ Crossing number, pair-crossing number, and expansion ⋮ The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph ⋮ Stack-number is not bounded by queue-number ⋮ The 2-page crossing number of \(K_{n}\) ⋮ On \(k\)-planar crossing numbers ⋮ Book drawings of complete bipartite graphs ⋮ Experimental Evaluation of Book Drawing Algorithms ⋮ Approximating the fixed linear crossing number ⋮ An analysis of some linear graph layout heuristics ⋮ One- and two-page crossing numbers for some types of graphs ⋮ Unnamed Item ⋮ On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page ⋮ Graph Classes and Forbidden Patterns on Three Vertices ⋮ Book Embeddings of Regular Graphs ⋮ Crossing Minimisation Heuristics for 2-page Drawings

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