The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph

zbMath1388.05046arXiv1708.01942MaRDI QIDQ1640218

Carolina Medina, Jesús Leaños, Frank Duque, Hernán González-Aguilar, César Hernández-Vélez

Publication date: 14 June 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.01942

zbMATH Keywords

\(t\)-circle crossing numberbook crossing numbercylindrical crossing number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Bounding the tripartite‐circle crossing number of complete tripartite graphs

Cites Work

• The book thickness of a graph
• Long cycles in 3-connected graphs
• The graph crossing number and its variants: a survey
• The early history of the brick factory problem
• Shellable drawings and the cylindrical crossing number of \(K_n\)
• Global k-Level Crossing Reduction
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• The book crossing number of a graph
• On the Number of Crossings in a Complete Graph

This page was built for publication: The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph