Relating Graph Thickness to Planar Layers and Bend Complexity
From MaRDI portal
Publication:4556953
DOI10.1137/16M1110042zbMath1400.05063arXiv1602.07816OpenAlexW2963980127MaRDI QIDQ4556953
Stephane Durocher, Debajyoti Mondal
Publication date: 28 November 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07816
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On graph thickness, geometric thickness, and separator theorems
- Thickness and colorability of geometric graphs
- Curve-constrained drawings of planar graphs
- On simultaneous planar graph embeddings
- Drawing colored graphs on colored points
- Partitioning a sequence into few monotone subsequences
- Geometric thickness in a grid
- Graph treewidth and geometric thickness parameters
- Bounded-degree graphs have arbitrarily large geometric thickness
- Simultaneous Embeddings with Vertices Mapping to Pre-specified Points
- Simultaneous Embeddings with Few Bends and Crossings
- Monotone Simultaneous Embeddings of Paths in d Dimensions
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Geometric Thickness of Complete Graphs
- Relating Graph Thickness to Planar Layers and Bend Complexity.
- Colored Point-Set Embeddings of Acyclic Graphs
- Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
- Simultaneous Embedding of Planar Graphs with Few Bends
- The geometric thickness of low degree graphs
- Monotonic Subsequences
- Embedding planar graphs at fixed vertex locations
This page was built for publication: Relating Graph Thickness to Planar Layers and Bend Complexity
