Imagen de Portada

Rectangular Duals on the Cylinder and the Torus

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Biedl, Therese, Kindermann, Philipp, Klawitter, Jonathan
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry Discrete Mathematics 68R10, 05C62
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Outside-Obstacle Representations with All Vertices on the Outer Face
por: Firman, Oksana, et al.
Publicado: (2022)

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

On the $d$-independence number in 1-planar graphs
por: Biedl, Therese, et al.
Publicado: (2024)

Determining Factorial Speed Fast
por: Feng, Zhidan, et al.
Publicado: (2026)

Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns
por: Paul, Indrajit, et al.
Publicado: (2025)

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

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

Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
por: Hliněný, Petr
Publicado: (2023)

Crossing Number is NP-hard for Constant Path-width (and Tree-width)
por: Hliněný, Petr, et al.
Publicado: (2024)

An efficient algorithm for generating transmission irregular trees
por: Stošić, Ivan, et al.
Publicado: (2025)

Geometric realizations of dichotomous ordinal graphs
por: Angelini, Patrizio, et al.
Publicado: (2025)

Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees
por: S, Rajeshwari, et al.
Publicado: (2022)

Structure of $k$-Matching-Planar Graphs
por: Hendrey, Kevin, et al.
Publicado: (2025)

New Vertex Ordering Characterizations of Circular-Arc Bigraphs
por: Paul, Indrajit, et al.
Publicado: (2025)

Towards Characterization of 5-List-Colorability of Toroidal Graphs
por: Dvořák, Zdeněk, et al.
Publicado: (2024)

On Edge-Disjoint Maximal Outerplanar Graphs
por: Okada, Yuto, et al.
Publicado: (2026)

Closeness and Residual Closeness of Harary Graphs
por: Golpek, Hande Tuncel, et al.
Publicado: (2023)

Paired many-to-many 2-disjoint path cover of Johnson graphs
por: Liu, Jinhao, et al.
Publicado: (2025)

Degree Realization by Bipartite Multigraphs
por: Bar-Noy, Amotz, et al.
Publicado: (2025)

Extremal Results on Conflict-free Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2023)

Symmetric properties and two variants of shuffle-cubes
por: Lü, Huazhong, et al.
Publicado: (2021)

Improved bounds for acyclic coloring parameters
por: Kirousis, Lefteris, et al.
Publicado: (2022)

The damage number of the Cartesian product of graphs
por: Huggan, Melissa A., et al.
Publicado: (2023)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
por: Inoue, Yuta, et al.
Publicado: (2024)

Boolean combinations of graphs
por: Adenwalla, Sarosh, et al.
Publicado: (2024)

Packing, Hitting, and Colouring Squares
por: Caoduro, Marco, et al.
Publicado: (2022)

Symmetry classes of Hamiltonian cycles
por: Baligacs, Julia, et al.
Publicado: (2025)

Excluding $K_{2,t}$ as a fat minor
por: Albrechtsen, Sandra, et al.
Publicado: (2025)

Untangling Gaussian Mixtures
por: Fluck, Eva, et al.
Publicado: (2024)

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
por: Hatzel, Meike, et al.
Publicado: (2024)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
por: Furmańczyk, Hanna, et al.
Publicado: (2020)

Analyzing Network Robustness via Residual Closeness
por: Golpek, Hande Tuncel, et al.
Publicado: (2026)

Small-scale operations on graphic sequences
por: Rusu, Irena
Publicado: (2026)

Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms
por: Hintze, Lukas, et al.
Publicado: (2024)

Noisy group testing via spatial coupling
por: Coja-Oghlan, Amin, et al.
Publicado: (2024)

Catching Rats in $H$-minor-free Graphs
por: Gorsky, Maximilian, et al.
Publicado: (2025)

Reducing Dominating Sets in Graphs
por: Inza, Ernesto Parra, et al.
Publicado: (2024)

Layered tree-independence number and clique-based separators
por: Dallard, Clément, et al.
Publicado: (2025)

A Note on Small Percolating Sets on Hypercubes via Generative AI
por: Bérczi, Gergely, et al.
Publicado: (2024)

Bad local minima exist in the stochastic block model
por: Coja-Oghlan, Amin, et al.
Publicado: (2024)