Cover Image

Minimizing an Uncrossed Collection of Drawings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hliněný, Petr, Masařík, Tomáš
Format:	Preprint
Published:	2023
Subjects:	Computational Geometry Discrete Mathematics Combinatorics 68R10 G.2.2; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

Some Counterexamples for Compatible Triangulations
by: Barnson, Cody, et al.
Published: (2016)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)

Thick Forests
by: Dyer, Martin, et al.
Published: (2023)

Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points
by: Rose, Valentino Delle, et al.
Published: (2023)

A Tight Meta-theorem for LOCAL Certification of MSO$_2$ Properties within Bounded Treewidth Graphs
by: Cook, Linda, et al.
Published: (2025)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)

Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
by: Chimani, Markus, et al.
Published: (2024)

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

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
by: Büngener, Aaron, et al.
Published: (2024)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
by: Loth, Jesse Campion, et al.
Published: (2022)

Optimal covering of rectangular grid graphs with tours of constrained length
by: Bereg, Sergey, et al.
Published: (2025)

On the spectra of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2025)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
by: Behera, Diptimaya, et al.
Published: (2025)

Some integer values in the spectra of burnt pancake graphs
by: Blanco, Saúl A., et al.
Published: (2024)

Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)

Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

On Minimum Maximal Distance-k Matchings
by: Kartynnik, Yury, et al.
Published: (2016)

The Ultimate Signs of Second-Order Holonomic Sequences
by: Hagihara, Fugen, et al.
Published: (2025)

A framework for distributed discrete evacuation strategies
by: Borowiecki, Piotr, et al.
Published: (2025)

On plane cycles in geometric multipartite graphs
by: Ricci, Marco, et al.
Published: (2025)

Flipping odd matchings in geometric and combinatorial settings
by: Aichholzer, Oswin, et al.
Published: (2025)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
by: Laekhanukit, Bundit
Published: (2024)

New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
by: Demaine, Erik D., et al.
Published: (2024)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)