Imagen de Portada

On the Uncrossed Number of Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Balko, Martin, Hliněný, Petr, Masařík, Tomáš, Orthaber, Joachim, Vogtenhuber, Birgit, Wagner, Mirko H.
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Computational Geometry Discrete Mathematics 68R10 G.2.2; F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Minimizing an Uncrossed Collection of Drawings
por: Hliněný, Petr, et al.
Publicado: (2023)

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

Some Counterexamples for Compatible Triangulations
por: Barnson, Cody, et al.
Publicado: (2016)

Interval Graphs are Reconstructible
por: Heinrich, Irene, et al.
Publicado: (2025)

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

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

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

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

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

Completely independent spanning trees in the hypercube
por: Shaw, Benedict Randall
Publicado: (2024)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
por: Bom, David, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
por: Masařík, Tomáš, et al.
Publicado: (2026)

Thick Forests
por: Dyer, Martin, et al.
Publicado: (2023)

Exact Minimum Weight Spanners via Column Generation
por: Bökler, Fritz, et al.
Publicado: (2024)

Counting Kernels in Directed Graphs with Arbitrary Orientations
por: Jartoux, Bruno
Publicado: (2022)

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

An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs
por: Araki, Toru
Publicado: (2026)

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

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

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
por: MacRury, Calum, et al.
Publicado: (2022)

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

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

The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
por: Wittwer, David, et al.
Publicado: (2024)

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

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

Compact Representation of Semilinear and Terrain-like Graphs
por: Cardinal, Jean, et al.
Publicado: (2025)

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

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

The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
por: Abbasizanjani, Hoda, et al.
Publicado: (2020)

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

On λ-backbone coloring of cliques with tree backbones in linear time
por: Michalik, Krzysztof, et al.
Publicado: (2021)

Online Bipartite Matching in the Probe-Commit Model
por: Borodin, Allan, et al.
Publicado: (2023)