Image de couverture de livre

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Asiri, Zayed, Burdett, Ryan, Chimani, Markus, Haythorpe, Michael, Newcombe, Alex, Wagner, Mirko H.
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics Discrete Mathematics 05C62, 68R10 G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
par: Chimani, Markus, et autres
Publié: (2024)

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

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
par: Chimani, Markus, et autres
Publié: (2021)

Exact Minimum Weight Spanners via Column Generation
par: Bökler, Fritz, et autres
Publié: (2024)

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

Fast winning strategies for the attacker in eternal domination
par: Bagan, Guillaume, et autres
Publié: (2024)

Simple Approximations for General Spanner Problems
par: Bökler, Fritz, et autres
Publié: (2025)

Searching by Heterogeneous Agents
par: Dereniowski, Dariusz, et autres
Publié: (2021)

Bounds on the Twin-Width of Product Graphs
par: Pettersson, William, et autres
Publié: (2022)

Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
par: Chimani, Markus, et autres
Publié: (2023)

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

Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms
par: Hintze, Lukas, et autres
Publié: (2024)

Noisy group testing via spatial coupling
par: Coja-Oghlan, Amin, et autres
Publié: (2024)

Some Counterexamples for Compatible Triangulations
par: Barnson, Cody, et autres
Publié: (2016)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
par: Cavallaro, Dario, et autres
Publié: (2026)

Boolean combinations of graphs
par: Adenwalla, Sarosh, et autres
Publié: (2024)

Interval Graphs are Reconstructible
par: Heinrich, Irene, et autres
Publié: (2025)

Thick Forests
par: Dyer, Martin, et autres
Publié: (2023)

Adjacency Labeling Schemes for Small Classes
par: Bonnet, Édouard, et autres
Publié: (2024)

Determining Factorial Speed Fast
par: Feng, Zhidan, et autres
Publié: (2026)

The Hierarchy of Saturating Matching Numbers
par: Simon, Hans U., et autres
Publié: (2025)

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

Completely independent spanning trees in the hypercube
par: Shaw, Benedict Randall
Publié: (2024)

Monotone Arc Diagrams with few Biarcs
par: Chaplick, Steven, et autres
Publié: (2024)

Lower Bounds for the Pfaffian Number of Graphs
par: Junchaya, Enrique, et autres
Publié: (2026)

On the spectra of prefix-reversal graphs
par: Blanco, Saúl A., et autres
Publié: (2025)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
par: Behera, Diptimaya, et autres
Publié: (2025)

Some integer values in the spectra of burnt pancake graphs
par: Blanco, Saúl A., et autres
Publié: (2024)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
par: Gabryelski, Wojciech, et autres
Publié: (2026)

Induced Disjoint Paths Without an Induced Minor
par: Aboulker, Pierre, et autres
Publié: (2025)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

A framework for distributed discrete evacuation strategies
par: Borowiecki, Piotr, et autres
Publié: (2025)

Graphs whose vertices of degree at least 2 lie in a triangle
par: Forte, Vinicius L. do, et autres
Publié: (2022)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
par: Bonnet, Édouard, et autres
Publié: (2026)

Catching Rats in $H$-minor-free Graphs
par: Gorsky, Maximilian, et autres
Publié: (2025)

Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points
par: Rose, Valentino Delle, et autres
Publié: (2023)

Homomorphism Counts to Trees
par: Dawar, Anuj
Publié: (2024)

Stack and Queue Numbers of Graphs Revisited
par: Hliněný, Petr, et autres
Publié: (2023)

The Ultimate Signs of Second-Order Holonomic Sequences
par: Hagihara, Fugen, et autres
Publié: (2025)

Temporalizing digraphs via linear-size balanced bi-trees
par: Bessy, Stéphane, et autres
Publié: (2023)