Image de couverture de livre

Crossing and non-crossing families

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Antić, Todor, Balko, Martin, Vogtenhuber, Birgit
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Computational Geometry G.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Uncrossed Number of Graphs
par: Balko, Martin, et autres
Publié: (2024)

Star-Forest Decompositions of Complete Graphs
par: Antić, Todor, et autres
Publié: (2024)

Reconfigurations of Plane Caterpillars and Paths
par: Antić, Todor, et autres
Publié: (2024)

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
par: Aichholzer, Oswin, et autres
Publié: (2023)

Hypercube drawings with no long plane paths
par: Antić, Todor, et autres
Publié: (2026)

On the geometric $k$-colored crossing number of $K_n$
par: Hahn, Benedikt, et autres
Publié: (2025)

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
par: Aichholzer, Oswin, et autres
Publié: (2024)

How many times can two minimum spanning trees cross?
par: Antić, Todor, et autres
Publié: (2026)

Two Results on Outer-String Graphs
par: Antić, Todor, et autres
Publié: (2026)

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
par: Bjerkevik, Håvard Bakke, et autres
Publié: (2026)

Flipping Non-Crossing Spanning Trees
par: Bjerkevik, Håvard Bakke, et autres
Publié: (2024)

Constrained Flips in Plane Spanning Trees
par: Aichholzer, Oswin, et autres
Publié: (2025)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
par: Bom, David, et autres
Publié: (2025)

Characterizing and Recognizing Twistedness
par: Aichholzer, Oswin, et autres
Publié: (2025)

Bounding and computing obstacle numbers of graphs
par: Balko, Martin, et autres
Publié: (2022)

On plane cycles in geometric multipartite graphs
par: Ricci, Marco, et autres
Publié: (2025)

An Improved Lower Bound on the Number of Pseudoline Arrangements
par: Kühnast, Fernando Cortés, et autres
Publié: (2024)

Finite k-Transversals of Infinite Families of Fat Convex Sets
par: Chakraborty, Sutanoya, et autres
Publié: (2022)

Optimal covering of rectangular grid graphs with tours of constrained length
par: Bereg, Sergey, et autres
Publié: (2025)

NumPSLA -- An experimental research tool for pseudoline arrangements and order types
par: Rote, Günter
Publié: (2025)

Rainbow polygons for colored point sets in the plane
par: Flores-Peñaloza, David, et autres
Publié: (2020)

On Grundy indices for complete geometric graphs
par: Lara, Dolores, et autres
Publié: (2025)

The Euclidean MST-ratio for Bi-colored Lattices
par: di Montesano, Sebastiano Cultrera, et autres
Publié: (2024)

Arrangements of Pseudocircles: On Digons and Triangles
par: Felsner, Stefan, et autres
Publié: (2022)

The number of rooted spanning forests of bicirculant graphs
par: Yang, Jing, et autres
Publié: (2025)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
par: Charvy, Gaspard, et autres
Publié: (2025)

Minimizing an Uncrossed Collection of Drawings
par: Hliněný, Petr, et autres
Publié: (2023)

Faster Mixing for Triangulations via Transport Flows
par: Alev, Vedat Levi, et autres
Publié: (2026)

On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions
par: Rubin, Natan
Publié: (2026)

Unbent Collections of Orthogonal Drawings
par: Antić, Todor, et autres
Publié: (2025)

Degenerate crossing number and signed reversal distance
par: Fuladi, Niloufar, et autres
Publié: (2023)

The maximum number of digons formed by pairwise crossing pseudocircles
par: Ackerman, Eyal, et autres
Publié: (2024)

Sublevels in arrangements and the spherical arc crossing number of complete graphs
par: Streltsova, Elizaveta, et autres
Publié: (2025)

On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs
par: Fabila-Monroy, Ruy, et autres
Publié: (2024)

Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors
par: Dujmović, Vida, et autres
Publié: (2024)

Rapid mixing of the flip chain over non-crossing spanning trees
par: Anand, Konrad, et autres
Publié: (2024)

Construction of Toroidal Polyhedra corresponding to perfect Chains of wild Tetrahedra
par: Akpanya, Reymond, et autres
Publié: (2024)

Crossing Number of 3-Plane Drawings
par: Goetze, Miriam, et autres
Publié: (2025)

Crossing lemmas for $k$-systems of arcs
par: Hubard, Alfredo, et autres
Publié: (2024)

On the Diameter of Arrangements of Topological Disks
par: Abiad, Aida, et autres
Publié: (2025)