Crossing Number of 3-Plane Drawings
Fuente:
arXiv
Saved in:
| Main Authors: | Goetze, Miriam, Hoffmann, Michael, Rutter, Ignaz, Ueckerdt, Torsten |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
On $k$-Plane Insertion into Plane Drawings
by: Katheder, Julia, et al.
Published: (2024)
by: Katheder, Julia, et al.
Published: (2024)
Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026)
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026)
Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)
Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)
by: Goetze, Miriam, et al.
Published: (2024)
Plane Hamiltonian Cycles in Convex Drawings
by: Bergold, Helena, et al.
Published: (2024)
by: Bergold, Helena, et al.
Published: (2024)
Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)
by: Merker, Laura, et al.
Published: (2024)
Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
by: Aichholzer, Oswin, et al.
Published: (2023)
by: Aichholzer, Oswin, et al.
Published: (2023)
Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
by: Aichholzer, Oswin, et al.
Published: (2024)
by: Aichholzer, Oswin, et al.
Published: (2024)
k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)
by: Hliněný, Petr, et al.
Published: (2025)
Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors
by: Dujmović, Vida, et al.
Published: (2024)
by: Dujmović, Vida, et al.
Published: (2024)
Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)
by: Schneider, Samuel, et al.
Published: (2025)
Upward-Planar Drawings with Bounded Span
by: Angelini, Patrizio, et al.
Published: (2026)
by: Angelini, Patrizio, et al.
Published: (2026)
A Simple Partially Embedded Planarity Test Based on Vertex-Addition
by: Fink, Simon D., et al.
Published: (2024)
by: Fink, Simon D., et al.
Published: (2024)
On the Largest Convexity Number of Co-Finite Sets in the Plane
by: Keller, Chaya, et al.
Published: (2026)
by: Keller, Chaya, et al.
Published: (2026)
Undecidability of Translational Tiling of the Plane with Four Tiles
by: Yang, Chao, et al.
Published: (2025)
by: Yang, Chao, et al.
Published: (2025)
Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
by: Yang, Chao, et al.
Published: (2025)
by: Yang, Chao, et al.
Published: (2025)
Saturated Drawings of Geometric Thickness k
by: Bachmann, Patricia, et al.
Published: (2025)
by: Bachmann, Patricia, et al.
Published: (2025)
Strong odd coloring in minor-closed classes
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Upward Book Embeddings of Partitioned Digraphs
by: Da Lozzo, Giordano, et al.
Published: (2026)
by: Da Lozzo, Giordano, et al.
Published: (2026)
Investigating Simple Drawings of $K_n$ using SAT
by: Bergold, Helena, et al.
Published: (2025)
by: Bergold, Helena, et al.
Published: (2025)
On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane
by: Edelsbrunner, Herbert, et al.
Published: (2022)
by: Edelsbrunner, Herbert, et al.
Published: (2022)
Improved Lower Bound on the Number of Pseudoline Arrangements
by: Dallant, Justin
Published: (2024)
by: Dallant, Justin
Published: (2024)
Plane Strong Connectivity Augmentation
by: Bessy, Stéphane, et al.
Published: (2025)
by: Bessy, Stéphane, et al.
Published: (2025)
Bounding and computing obstacle numbers of graphs
by: Balko, Martin, et al.
Published: (2022)
by: Balko, Martin, et al.
Published: (2022)
A Note on Polychromatic Colorings of Shift-Chains
by: Ueckerdt, Torsten
Published: (2024)
by: Ueckerdt, Torsten
Published: (2024)
Constrained Flips in Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2025)
by: Aichholzer, Oswin, et al.
Published: (2025)
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)
by: Jungeblut, Paul, et al.
Published: (2022)
Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
by: Draganov, Ondřej, et al.
Published: (2025)
by: Draganov, Ondřej, et al.
Published: (2025)
Crossing lemmas for $k$-systems of arcs
by: Hubard, Alfredo, et al.
Published: (2024)
by: Hubard, Alfredo, et al.
Published: (2024)
On Computing Vertex Connectivity of 1-Plane Graphs
by: Biedl, Therese, et al.
Published: (2022)
by: Biedl, Therese, et al.
Published: (2022)
Note on the Number of Almost Ordinary Triangles
by: Dumitrescu, Adrian, et al.
Published: (2025)
by: Dumitrescu, Adrian, et al.
Published: (2025)
On the Number of Almost Empty Monochromatic Triangles
by: Bhattacharya, Bhaswar B., et al.
Published: (2026)
by: Bhattacharya, Bhaswar B., et al.
Published: (2026)
Clustered Planarity Variants for Level Graphs
by: Fink, Simon D., et al.
Published: (2024)
by: Fink, Simon D., et al.
Published: (2024)
On the complexity of embedding in graph products
by: Biedl, Therese, et al.
Published: (2023)
by: Biedl, Therese, et al.
Published: (2023)
Bounds on the Number of Pieces in Continuous Piecewise Affine Functions
by: Zanotti, Leo
Published: (2025)
by: Zanotti, Leo
Published: (2025)
On Few-Distance Sets in the Plane
by: Wang, Lucas
Published: (2025)
by: Wang, Lucas
Published: (2025)
On the Undecidability of Tiling the $3$-dimensional Space with a Set of $3$ Polycubes
by: Yang, Chao, et al.
Published: (2025)
by: Yang, Chao, et al.
Published: (2025)
A Unified FPT Framework for Crossing Number Problems
by: de Verdière, Éric Colin, et al.
Published: (2024)
by: de Verdière, Éric Colin, et al.
Published: (2024)
Similar Items
-
The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025) -
On $k$-Plane Insertion into Plane Drawings
by: Katheder, Julia, et al.
Published: (2024) -
Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025) -
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026) -
Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)