The crossing number of twisted graphs
DOI10.1007/s00373-022-02538-3zbMath1497.05050OpenAlexW4290659439MaRDI QIDQ2163801
Silvia Fernández-Merchant, Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Eduardo Rivera-Campo, Bernardo M. Ábrego
Publication date: 11 August 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02538-3
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Improving the crossing lemma by finding more crossings in sparse graphs
- Graphs drawn with few crossings per edge
- Unavoidable configurations in complete topological graphs
- New bounds on crossing numbers
- The graph crossing number and its variants: a survey
- On topological graphs with at most four crossings per edge
- The 2-page crossing number of \(K_{n}\)
- Shellable drawings and the cylindrical crossing number of \(K_n\)
- A lower bound for the rectilinear crossing number
- Crossing-Free Subgraphs
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Graph Layout Aesthetics in UML Diagrams: User Preferences
- Crossing Numbers of Graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Notes on the Twisted Graph
- On the Number of Crossings in a Complete Graph
This page was built for publication: The crossing number of twisted graphs
