Saved in:
| Main Authors: | Hliněný, Petr, Korbela, Michal |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2105.01104 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Twin-width of Planar Graphs; a Short Proof
by: Hliněný, Petr
Published: (2023)
by: Hliněný, Petr
Published: (2023)
k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)
by: Hliněný, Petr, et al.
Published: (2025)
Transductions of Graph Classes Admitting Product Structure
by: Hliněný, Petr, et al.
Published: (2025)
by: Hliněný, Petr, et al.
Published: (2025)
Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023)
by: Hliněný, Petr, et al.
Published: (2023)
Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)
by: Hliněný, Petr, et al.
Published: (2024)
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)
A Unified FPT Framework for Crossing Number Problems
by: de Verdière, Éric Colin, et al.
Published: (2024)
by: de Verdière, Éric Colin, et al.
Published: (2024)
Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)
by: Hliněný, Petr, et al.
Published: (2023)
Structure and generation of crossing-critical graphs
by: Dvořák, Zdeněk, et al.
Published: (2018)
by: Dvořák, Zdeněk, et al.
Published: (2018)
Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
by: Hliněný, Petr
Published: (2023)
by: Hliněný, Petr
Published: (2023)
Measuring Depth of Matroids
by: Balabán, Jakub, et al.
Published: (2026)
by: Balabán, Jakub, et al.
Published: (2026)
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
by: Bok, Jan, et al.
Published: (2021)
by: Bok, Jan, et al.
Published: (2021)
On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)
by: Balko, Martin, et al.
Published: (2024)
Triangle-free Graphs with Large Minimum Common Degree
by: Wang, Jian, et al.
Published: (2024)
by: Wang, Jian, et al.
Published: (2024)
Proper Conflict-free Coloring of Graphs with Large Maximum Degree
by: Cranston, Daniel W., et al.
Published: (2022)
by: Cranston, Daniel W., et al.
Published: (2022)
Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
by: D'Elia, Marco, et al.
Published: (2024)
by: D'Elia, Marco, et al.
Published: (2024)
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
by: Dujmović, Vida, et al.
Published: (2022)
by: Dujmović, Vida, et al.
Published: (2022)
Degree-Similar Graphs
by: Godsil, Chris, et al.
Published: (2024)
by: Godsil, Chris, et al.
Published: (2024)
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)
Maximum Spread of Vertex Degrees in a Simple Graph
by: Onishchenko, Sergey Dmitrievich
Published: (2025)
by: Onishchenko, Sergey Dmitrievich
Published: (2025)
Efficient Enumeration of Cliques in Graphs with Bounded Maximum Degree
by: Gong, Shi-Cai, et al.
Published: (2026)
by: Gong, Shi-Cai, et al.
Published: (2026)
Degrees and Connectivities of a Graph and Its $δ$-Complement
by: Srisawat, Supakorn, et al.
Published: (2024)
by: Srisawat, Supakorn, et al.
Published: (2024)
Partition of Sparse Graphs into Two Forests with Bounded Degree
by: Yancey, Matthew
Published: (2024)
by: Yancey, Matthew
Published: (2024)
Clustered Coloring of Graphs with Bounded Layered Treewidth and Bounded Degree
by: Liu, Chun-Hung, et al.
Published: (2022)
by: Liu, Chun-Hung, et al.
Published: (2022)
2-Distance Coloring of Planar Graphs with Specific Maximum Degree
by: Hajjar, Sara Al
Published: (2025)
by: Hajjar, Sara Al
Published: (2025)
On $S$-packing Coloring of Bounded Degree Graphs
by: Mortada, Maidoun, et al.
Published: (2025)
by: Mortada, Maidoun, et al.
Published: (2025)
Judicious Partitions in Edge-Weighted Graphs with Bounded Maximum Weighted Degree
by: Gutin, G., et al.
Published: (2025)
by: Gutin, G., et al.
Published: (2025)
On Wegner's 8-Coloring Theorem for Planar Graphs of Maximum Degree Three
by: Elvin, Gabriel, et al.
Published: (2025)
by: Elvin, Gabriel, et al.
Published: (2025)
Degree Sequences vs. Forests in Bipartite Graphs
by: Grinberg, Darij, et al.
Published: (2026)
by: Grinberg, Darij, et al.
Published: (2026)
Density of Traceable Graphs
by: Dvořák, Michal, et al.
Published: (2025)
by: Dvořák, Michal, et al.
Published: (2025)
String Graph Obstacles of High Girth and of Bounded Degree
by: Chudnovsky, Maria, et al.
Published: (2025)
by: Chudnovsky, Maria, et al.
Published: (2025)
Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)
by: Gahlawat, Harmender
Published: (2025)
A Modular Inductive Proof of the Chen-Raspaud Conjecture via Graph Classification
by: Fiedorowicz, Michał
Published: (2024)
by: Fiedorowicz, Michał
Published: (2024)
Duality and $χ^<$-Boundedness of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2023)
by: Čertík, Michal, et al.
Published: (2023)
Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
by: Galindo, Rachel, et al.
Published: (2025)
by: Galindo, Rachel, et al.
Published: (2025)
On Expansion of Random Regular Graphs: Improved Lower Bounds for Small Even Degrees
by: Manurangsi, Pasin
Published: (2026)
by: Manurangsi, Pasin
Published: (2026)
Ordering and Convergence of Large Degrees in Random Hyperbolic Graphs
by: Gassmann, Loïc
Published: (2024)
by: Gassmann, Loïc
Published: (2024)
Graphs that admit a Hamilton path are cup-stackable
by: Gregor, Petr, et al.
Published: (2024)
by: Gregor, Petr, et al.
Published: (2024)
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)
by: Gerke, Stefanie, et al.
Published: (2024)
A closure for Hamilton-connectedness in $\{K_{1,3},Γ_3\}$-free graphs
by: Kabela, Adam, et al.
Published: (2024)
by: Kabela, Adam, et al.
Published: (2024)
Similar Items
-
Twin-width of Planar Graphs; a Short Proof
by: Hliněný, Petr
Published: (2023) -
k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025) -
Transductions of Graph Classes Admitting Product Structure
by: Hliněný, Petr, et al.
Published: (2025) -
Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023) -
Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)