Thickness and coarseness of graphs
From MaRDI portal
Publication:2561601
Cites work
- Ein Sechsfarbenproblem auf der Kugel
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3451872 (Why is no real title available?)
- scientific article; zbMATH DE number 3235858 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
Cited in
(18)- Geometric thickness in a grid
- Note on \(k\)-planar crossing numbers
- The rectilinear local crossing number of \(K_{n}\)
- Partitions of complete geometric graphs into plane trees
- Drawing Cubic Graphs with the Four Basic Slopes
- On the page number of upward planar directed acyclic graphs
- Geometric Thickness in a Grid of Linear Area
- Cubic Graphs Have Bounded Slope Parameter
- Quasi-planar Graphs
- Angle covers: algorithms and complexity
- Complexity of geometric \(k\)-planarity for fixed \(k\)
- Straight-line drawings of 1-planar graphs
- The thickness of fan-planar graphs is at most three
- On graph thickness, geometric thickness, and separator theorems
- Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete
- On the biplanarity of blowups
- Thickness and colorability of geometric graphs
- Geometric parameters of bipartite suspensions
This page was built for publication: Thickness and coarseness of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2561601)
