Note on Min-k-Planar Drawings of Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Hliněný, Petr, Ködmön, Lili |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023)
by: Hliněný, Petr, et al.
Published: (2023)
Hereditary Graph Product Structure and $\cal H$-clique-width
by: Hliněný, Petr, et al.
Published: (2024)
by: Hliněný, Petr, 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)
Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)
by: Hliněný, Petr, et al.
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)
Structure of $k$-Matching-Planar Graphs
by: Hendrey, Kevin, et al.
Published: (2025)
by: Hendrey, Kevin, et al.
Published: (2025)
Grid-drawings of graphs in three-dimensions
by: Balogh, Jozsef, et al.
Published: (2024)
by: Balogh, Jozsef, et al.
Published: (2024)
Harmonious Colorings: bounds, heuristics and integer-linear formulations
by: Araújo, Júlio, et al.
Published: (2026)
by: Araújo, Júlio, et al.
Published: (2026)
On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)
by: Balko, Martin, et al.
Published: (2024)
Unbent Collections of Orthogonal Drawings
by: Antić, Todor, et al.
Published: (2025)
by: Antić, Todor, et al.
Published: (2025)
Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)
by: Bagan, Guillaume, et al.
Published: (2024)
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)
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)
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)
On Edge-Disjoint Maximal Outerplanar Graphs
by: Okada, Yuto, et al.
Published: (2026)
by: Okada, Yuto, et al.
Published: (2026)
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)
Approximate Sampling of Graphs with Near-$P$-stable Degree Intervals
by: Erdős, Péter L., et al.
Published: (2022)
by: Erdős, Péter L., et al.
Published: (2022)
Word-Representability of Graphs with respect to Split Recomposition
by: Dwary, Tithi, et al.
Published: (2024)
by: Dwary, Tithi, et al.
Published: (2024)
On solving basic equations over the semiring of functional digraphs
by: Dennunzio, Alberto, et al.
Published: (2024)
by: Dennunzio, Alberto, et al.
Published: (2024)
Recovery of cyclic words by their subwords
by: Luchinin, Sergey, et al.
Published: (2024)
by: Luchinin, Sergey, et al.
Published: (2024)
Palindromic length of infinite aperiodic words
by: Rukavicka, Josef
Published: (2024)
by: Rukavicka, Josef
Published: (2024)
String attractors and bi-infinite words
by: Béaur, Pierre, et al.
Published: (2024)
by: Béaur, Pierre, et al.
Published: (2024)
Additive word complexity and Walnut
by: Popoli, Pierre, et al.
Published: (2024)
by: Popoli, Pierre, et al.
Published: (2024)
Polygonal corona limit on multigrid dual tilings
by: Lutfalla, Victor, et al.
Published: (2024)
by: Lutfalla, Victor, et al.
Published: (2024)
On the pseudorandomness of Parry--Bertrand automatic sequences
by: Popoli, Pierre, et al.
Published: (2024)
by: Popoli, Pierre, et al.
Published: (2024)
Subexponential upper bound on the number of rich words
by: Rukavicka, Josef
Published: (2025)
by: Rukavicka, Josef
Published: (2025)
Remarks about the Moebius-Kantor graph
by: Knill, Oliver
Published: (2026)
by: Knill, Oliver
Published: (2026)
Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)
by: Dereniowski, Dariusz, et al.
Published: (2021)
Prime Multiple Missing Graphs
by: Ghosh, Shamik
Published: (2025)
by: Ghosh, Shamik
Published: (2025)
Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)
by: Pettersson, William, et al.
Published: (2022)
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)
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)
New Vertex Ordering Characterizations of Circular-Arc Bigraphs
by: Paul, Indrajit, et al.
Published: (2025)
by: Paul, Indrajit, et al.
Published: (2025)
An efficient algorithm for generating transmission irregular trees
by: Stošić, Ivan, et al.
Published: (2025)
by: Stošić, Ivan, et al.
Published: (2025)
Obstructions to return preservation for episturmian morphisms
by: Berthé, Valérie, et al.
Published: (2024)
by: Berthé, Valérie, et al.
Published: (2024)
Some Counterexamples for Compatible Triangulations
by: Barnson, Cody, et al.
Published: (2016)
by: Barnson, Cody, et al.
Published: (2016)
Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints
by: Klawitter, Jonathan, et al.
Published: (2023)
by: Klawitter, Jonathan, et al.
Published: (2023)
Similar Items
-
Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023) -
Hereditary Graph Product Structure and $\cal H$-clique-width
by: Hliněný, Petr, et al.
Published: (2024) -
Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
by: Hliněný, Petr
Published: (2023) -
Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023) -
Crossing Number is NP-hard for Constant Path-width (and Tree-width)
by: Hliněný, Petr, et al.
Published: (2024)