Thickness and coarseness of graphs

DOI10.1007/BF02992822zbMath0264.05108OpenAlexW2039139355WikidataQ130532600 ScholiaQ130532600MaRDI QIDQ2561601

Paul C. Kainen

Publication date: 1973

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02992822

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (15)

The rectilinear local crossing number of \(K_{n}\) ⋮ Angle Covers: Algorithms and Complexity ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ On the Page Number of Upward Planar Directed Acyclic Graphs ⋮ Straight-line drawings of 1-planar graphs ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ The thickness of fan-planar graphs is at most three ⋮ Note on \(k\)-planar crossing numbers ⋮ Geometric thickness in a grid ⋮ Complexity of Geometric k-Planarity for Fixed k ⋮ Thickness and colorability of geometric graphs ⋮ Partitions of complete geometric graphs into plane trees ⋮ Cubic Graphs Have Bounded Slope Parameter ⋮ Quasi-planar Graphs ⋮ Geometric Thickness in a Grid of Linear Area

Cites Work

• Ein Sechsfarbenproblem auf der Kugel
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Thickness and coarseness of graphs