Rectangular Duals on the Cylinder and the Torus
Fuente:
arXiv
Saved in:
| Main Authors: | Biedl, Therese, Kindermann, Philipp, Klawitter, Jonathan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Outside-Obstacle Representations with All Vertices on the Outer Face
by: Firman, Oksana, et al.
Published: (2022)
by: Firman, Oksana, et al.
Published: (2022)
Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
by: Chimani, Markus, et al.
Published: (2024)
by: Chimani, Markus, et al.
Published: (2024)
On the $d$-independence number in 1-planar graphs
by: Biedl, Therese, et al.
Published: (2024)
by: Biedl, Therese, et al.
Published: (2024)
Determining Factorial Speed Fast
by: Feng, Zhidan, et al.
Published: (2026)
by: Feng, Zhidan, et al.
Published: (2026)
Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns
by: Paul, Indrajit, et al.
Published: (2025)
by: Paul, Indrajit, et al.
Published: (2025)
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)
by: Asiri, Zayed, et al.
Published: (2024)
Monotone Arc Diagrams with few Biarcs
by: Chaplick, Steven, et al.
Published: (2024)
by: Chaplick, Steven, et al.
Published: (2024)
Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
by: Hliněný, Petr
Published: (2023)
by: Hliněný, Petr
Published: (2023)
Crossing Number is NP-hard for Constant Path-width (and Tree-width)
by: Hliněný, Petr, et al.
Published: (2024)
by: Hliněný, Petr, et al.
Published: (2024)
An efficient algorithm for generating transmission irregular trees
by: Stošić, Ivan, et al.
Published: (2025)
by: Stošić, Ivan, et al.
Published: (2025)
Geometric realizations of dichotomous ordinal graphs
by: Angelini, Patrizio, et al.
Published: (2025)
by: Angelini, Patrizio, et al.
Published: (2025)
Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees
by: S, Rajeshwari, et al.
Published: (2022)
by: S, Rajeshwari, et al.
Published: (2022)
Structure of $k$-Matching-Planar Graphs
by: Hendrey, Kevin, et al.
Published: (2025)
by: Hendrey, Kevin, et al.
Published: (2025)
New Vertex Ordering Characterizations of Circular-Arc Bigraphs
by: Paul, Indrajit, et al.
Published: (2025)
by: Paul, Indrajit, et al.
Published: (2025)
Towards Characterization of 5-List-Colorability of Toroidal Graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)
by: Dvořák, Zdeněk, et al.
Published: (2024)
On Edge-Disjoint Maximal Outerplanar Graphs
by: Okada, Yuto, et al.
Published: (2026)
by: Okada, Yuto, et al.
Published: (2026)
Closeness and Residual Closeness of Harary Graphs
by: Golpek, Hande Tuncel, et al.
Published: (2023)
by: Golpek, Hande Tuncel, et al.
Published: (2023)
Paired many-to-many 2-disjoint path cover of Johnson graphs
by: Liu, Jinhao, et al.
Published: (2025)
by: Liu, Jinhao, et al.
Published: (2025)
Degree Realization by Bipartite Multigraphs
by: Bar-Noy, Amotz, et al.
Published: (2025)
by: Bar-Noy, Amotz, et al.
Published: (2025)
Extremal Results on Conflict-free Coloring
by: Bhyravarapu, Sriram, et al.
Published: (2023)
by: Bhyravarapu, Sriram, et al.
Published: (2023)
Symmetric properties and two variants of shuffle-cubes
by: Lü, Huazhong, et al.
Published: (2021)
by: Lü, Huazhong, et al.
Published: (2021)
Improved bounds for acyclic coloring parameters
by: Kirousis, Lefteris, et al.
Published: (2022)
by: Kirousis, Lefteris, et al.
Published: (2022)
The damage number of the Cartesian product of graphs
by: Huggan, Melissa A., et al.
Published: (2023)
by: Huggan, Melissa A., et al.
Published: (2023)
Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
by: Inoue, Yuta, et al.
Published: (2024)
by: Inoue, Yuta, et al.
Published: (2024)
Boolean combinations of graphs
by: Adenwalla, Sarosh, et al.
Published: (2024)
by: Adenwalla, Sarosh, et al.
Published: (2024)
Packing, Hitting, and Colouring Squares
by: Caoduro, Marco, et al.
Published: (2022)
by: Caoduro, Marco, et al.
Published: (2022)
Symmetry classes of Hamiltonian cycles
by: Baligacs, Julia, et al.
Published: (2025)
by: Baligacs, Julia, et al.
Published: (2025)
Excluding $K_{2,t}$ as a fat minor
by: Albrechtsen, Sandra, et al.
Published: (2025)
by: Albrechtsen, Sandra, et al.
Published: (2025)
Untangling Gaussian Mixtures
by: Fluck, Eva, et al.
Published: (2024)
by: Fluck, Eva, et al.
Published: (2024)
Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
by: Hatzel, Meike, et al.
Published: (2024)
by: Hatzel, Meike, et al.
Published: (2024)
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)
by: Furmańczyk, Hanna, et al.
Published: (2020)
Analyzing Network Robustness via Residual Closeness
by: Golpek, Hande Tuncel, et al.
Published: (2026)
by: Golpek, Hande Tuncel, et al.
Published: (2026)
Small-scale operations on graphic sequences
by: Rusu, Irena
Published: (2026)
by: Rusu, Irena
Published: (2026)
Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms
by: Hintze, Lukas, et al.
Published: (2024)
by: Hintze, Lukas, et al.
Published: (2024)
Noisy group testing via spatial coupling
by: Coja-Oghlan, Amin, et al.
Published: (2024)
by: Coja-Oghlan, Amin, et al.
Published: (2024)
Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)
by: Gorsky, Maximilian, et al.
Published: (2025)
Reducing Dominating Sets in Graphs
by: Inza, Ernesto Parra, et al.
Published: (2024)
by: Inza, Ernesto Parra, et al.
Published: (2024)
Layered tree-independence number and clique-based separators
by: Dallard, Clément, et al.
Published: (2025)
by: Dallard, Clément, et al.
Published: (2025)
A Note on Small Percolating Sets on Hypercubes via Generative AI
by: Bérczi, Gergely, et al.
Published: (2024)
by: Bérczi, Gergely, et al.
Published: (2024)
Bad local minima exist in the stochastic block model
by: Coja-Oghlan, Amin, et al.
Published: (2024)
by: Coja-Oghlan, Amin, et al.
Published: (2024)
Similar Items
-
Outside-Obstacle Representations with All Vertices on the Outer Face
by: Firman, Oksana, et al.
Published: (2022) -
Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
by: Chimani, Markus, et al.
Published: (2024) -
On the $d$-independence number in 1-planar graphs
by: Biedl, Therese, et al.
Published: (2024) -
Determining Factorial Speed Fast
by: Feng, Zhidan, et al.
Published: (2026) -
Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns
by: Paul, Indrajit, et al.
Published: (2025)