Edge densities of drawings of graphs with one forbidden cell
Fuente:
arXiv
Saved in:
| Main Authors: | Hahn, Benedikt, Ueckerdt, Torsten, Vogtenhuber, Birgit |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the geometric $k$-colored crossing number of $K_n$
by: Hahn, Benedikt, et al.
Published: (2025)
by: Hahn, Benedikt, et al.
Published: (2025)
Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)
A Note on Polychromatic Colorings of Shift-Chains
by: Ueckerdt, Torsten
Published: (2024)
by: Ueckerdt, Torsten
Published: (2024)
Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)
by: Schneider, Samuel, et al.
Published: (2025)
The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)
by: Knauer, Kolja, et al.
Published: (2023)
Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)
by: Davies, James, et al.
Published: (2025)
Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)
by: Jungeblut, Paul, et al.
Published: (2022)
Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)
by: Goetze, Miriam, et al.
Published: (2024)
Cops and Robber -- When Capturing is not Surrounding
by: Jungeblut, Paul, et al.
Published: (2023)
by: Jungeblut, Paul, et al.
Published: (2023)
Partitioning a Planar Graph into two Triangle-Forests
by: Knauer, Kolja, et al.
Published: (2024)
by: Knauer, Kolja, et al.
Published: (2024)
Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)
by: Duron, Julien, et al.
Published: (2024)
Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)
by: Balko, Martin, et al.
Published: (2025)
List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)
by: Piecyk, Marta, et al.
Published: (2025)
Constrained Flips in Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2025)
by: Aichholzer, Oswin, et al.
Published: (2025)
Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
by: Aichholzer, Oswin, et al.
Published: (2024)
by: Aichholzer, Oswin, et al.
Published: (2024)
Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)
by: Ha, Minh Tuan, et al.
Published: (2023)
Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)
by: Hatzel, Meike, et al.
Published: (2023)
Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
by: Kurapov, Sergey, et al.
Published: (2025)
by: Kurapov, Sergey, et al.
Published: (2025)
Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)
by: Mütze, Torsten, et al.
Published: (2024)
On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
by: Adekanye, Melvin, et al.
Published: (2024)
by: Adekanye, Melvin, et al.
Published: (2024)
Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)
by: Merker, Laura, et al.
Published: (2024)
Long induced paths and forbidden patterns: Polylogarithmic bounds
by: Duron, Julien, et al.
Published: (2024)
by: Duron, Julien, et al.
Published: (2024)
Interval H-graphs : Recognition and forbidden obstructions
by: Müller, Haiko, et al.
Published: (2025)
by: Müller, Haiko, 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)
Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)
by: Behrooznia, Nastaran, et al.
Published: (2024)
Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
by: Bom, David, et al.
Published: (2025)
by: Bom, David, et al.
Published: (2025)
Edge open packing on subclasses of chordal graphs
by: Santra, Kamal
Published: (2025)
by: Santra, Kamal
Published: (2025)
Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)
by: Bastide, Paul, et al.
Published: (2024)
Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
by: Kurapov, Sergey, et al.
Published: (2025)
by: Kurapov, Sergey, et al.
Published: (2025)
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)
by: Lozin, Vadim, et al.
Published: (2022)
Combinatorial Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022)
by: Mütze, Torsten
Published: (2022)
Rainbow polygons for colored point sets in the plane
by: Flores-Peñaloza, David, et al.
Published: (2020)
by: Flores-Peñaloza, David, et al.
Published: (2020)
On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)
by: Kaul, Neel, et al.
Published: (2025)
The one-visibility Localization game
by: Bonato, Anthony, et al.
Published: (2023)
by: Bonato, Anthony, et al.
Published: (2023)
Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)
by: Gregor, Petr, et al.
Published: (2023)
Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)
by: Berthe, Gaétan, et al.
Published: (2025)
Similar Items
-
On the geometric $k$-colored crossing number of $K_n$
by: Hahn, Benedikt, et al.
Published: (2025) -
Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024) -
A Note on Polychromatic Colorings of Shift-Chains
by: Ueckerdt, Torsten
Published: (2024) -
Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025) -
The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)