Cover Image

Bounding and computing obstacle numbers of graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Balko, Martin, Chaplick, Steven, Ganian, Robert, Gupta, Siddharth, Hoffmann, Michael, Valtr, Pavel, Wolff, Alexander
Format:	Preprint
Published:	2022
Subjects:	Computational Geometry Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

How many times can two minimum spanning trees cross?
by: Antić, Todor, et al.
Published: (2026)

Crossing and non-crossing families
by: Antić, Todor, et al.
Published: (2025)

Large chirotopes with computable numbers of triangulations
by: Bouvel, Mathilde, et al.
Published: (2026)

Monotone Arc Diagrams with few Biarcs
by: Chaplick, Steven, et al.
Published: (2024)

On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs
by: Fabila-Monroy, Ruy, et al.
Published: (2024)

The Borsuk number of a graph
by: Cáceres, José, et al.
Published: (2026)

Bounding the number of holes required for folding rectangular polyominoes into cubes
by: Lehner, Florian, et al.
Published: (2025)

Sublevels in arrangements and the spherical arc crossing number of complete graphs
by: Streltsova, Elizaveta, et al.
Published: (2025)

Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy
by: Gnewuch, Michael
Published: (2024)

Hypercube drawings with no long plane paths
by: Antić, Todor, et al.
Published: (2026)

Crossing Number of 3-Plane Drawings
by: Goetze, Miriam, et al.
Published: (2025)

On forbidden configurations in point-line incidence graphs
by: Balko, Martin, et al.
Published: (2024)

The Complexity of Drawing Graphs on Few Lines and Few Planes
by: Chaplick, Steven, et al.
Published: (2016)

Crossing numbers of dense graphs on surfaces
by: Hubard, Alfredo, et al.
Published: (2025)

Shellability is hard even for balls
by: Paták, Pavel, et al.
Published: (2022)

Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)
by: Biedl, Therese
Published: (2025)

The number of regular simplices in higher dimensions
by: Clemen, Felix Christian, et al.
Published: (2025)

Separators for intersection graphs of spheres
by: Fox, Jacob, et al.
Published: (2026)

On the number of digons in arrangements of pairwise intersecting circles
by: Ackerman, Eyal, et al.
Published: (2024)

Degenerate crossing number and signed reversal distance
by: Fuladi, Niloufar, et al.
Published: (2023)

Improved Lower Bound on the Number of Pseudoline Arrangements
by: Dallant, Justin
Published: (2024)

The maximum number of digons formed by pairwise crossing pseudocircles
by: Ackerman, Eyal, et al.
Published: (2024)

Linear relations between face numbers of levels in arrangements
by: Streltsova, Elizaveta, et al.
Published: (2025)

On saturated triangulation-free convex geometric graphs
by: Garber, David, et al.
Published: (2025)

On the number of tangencies among $1$-intersecting $x$-monotone curves
by: Ackerman, Eyal, et al.
Published: (2023)

Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
by: Davies, James, et al.
Published: (2024)

Unavoidable patterns and plane paths in dense topological graphs
by: Keszegh, Balázs, et al.
Published: (2025)

What induces plane structures in complete graph drawings?
by: Weinberger, Alexandra, et al.
Published: (2026)

Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
by: Alegría-Galicia, Carlos, et al.
Published: (2017)

Piercing independent sets in graphs without large induced matching
by: Ai, Jiangdong, et al.
Published: (2024)

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026)

Geometric graphs with exponential chromatic number and arbitrary girth
by: Bucić, Matija, et al.
Published: (2023)

A census of graph-drawing algorithms based on generalized transversal structures
by: Bernardi, Olivier, et al.
Published: (2024)

No-dimensional Tverberg-type problems
by: Polyanskii, Alexander
Published: (2025)

Beyond Outerplanarity
by: Chaplick, Steven, et al.
Published: (2017)

A Survey on Ordered Ramsey Numbers
by: Balko, Martin
Published: (2025)

Three Edge-disjoint Plane Spanning Paths in a Point Set
by: Kindermann, Philipp, et al.
Published: (2023)

Drums of high width
by: Davies, Alex, et al.
Published: (2025)

Globally rigid graphs are fully reconstructible
by: Garamvölgyi, Dániel, et al.
Published: (2021)

Bounding the diameter and eigenvalues of amply regular graphs via Lin-Lu-Yau curvature
by: Huang, Xueping, et al.
Published: (2022)