Bounded-degree graphs can have arbitrarily large slope numbers
zbMATH Open1080.05064MaRDI QIDQ2583679FDOQ2583679
Authors: János Pach, Dömötör Pálvölgyi 
Publication date: 17 January 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/125523
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Bounded-degree graphs have arbitrarily large geometric thickness
- Bounded-degree graphs have arbitrarily large queue-number
- Extremal size in graphs with bounded degree.
- Bounded degrees and prescribed distances in graphs
- Regular graphs of large girth and arbitrary degree
- Graphs with maximum size and lower bounded girth
- Distinguishing infinite graphs with bounded degrees
- On the number of connected sets in bounded degree graphs
- On the Number of Connected Sets in Bounded Degree Graphs
- Extremal graphs with bounded vertex bipartiteness number
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (23)
- Drawing cubic graphs with at most five slopes
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- Crossings in grid drawings
- Drawings of planar graphs with few slopes and segments
- Graph drawings with few slopes
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- Level-planar drawings with few slopes
- Bounded-degree graphs have arbitrarily large geometric thickness
- Drawing subcubic planar graphs with four slopes and optimal angular resolution
- Drawing Cubic Graphs with the Four Basic Slopes
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Outerplanar graph drawings with few slopes
- Upward planar drawings with three and more slopes
- Bounds on the crossing resolution of complete geometric graphs
- Level-planar drawings with few slopes
- Upward planar drawings with two slopes
- Cubic Graphs Have Bounded Slope Parameter
- The planar slope number of planar partial 3-trees of bounded degree
- Upward Planar Drawings with Three and More Slopes
- Geometric representation of cubic graphs with four directions
- On the complexity of the planar slope number problem
- Drawing partial 2-trees with few slopes
This page was built for publication: Bounded-degree graphs can have arbitrarily large slope numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583679)
