On the thickness of graphs of given degree

DOI10.1016/0020-0255(91)90052-VzbMath0761.05053OpenAlexW1996855544MaRDI QIDQ1174334

John H. Halton

Publication date: 25 June 1992

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(91)90052-v

zbMATH Keywords

degreethickness of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (29)

The thickness of amalgamations and Cartesian product of graphs ⋮ Sequential Monto Carlo techniques for the solution of linear systems ⋮ The thickness of a minor-excluded class of graphs ⋮ A tribute to Frank Harary (in honor of his 70th birthday) ⋮ Upward Point Set Embeddability for Convex Point Sets Is in P ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Planarization and fragmentability of some classes of graphs ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ On upward point set embeddability ⋮ Geometric thickness in a grid ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Point-set embeddings of trees with given partial drawings ⋮ Planar projections of graphs ⋮ Radial drawings of graphs: geometric constraints and trade-offs ⋮ Drawing colored graphs on colored points ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Drawing colored graphs with constrained vertex positions and few bends per edge ⋮ A note on Halton's conjecture ⋮ Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method ⋮ CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS ⋮ Embeddability Problems for Upward Planar Digraphs ⋮ Constrained Point-Set Embeddability of Planar Graphs ⋮ ON EMBEDDING A GRAPH ON TWO SETS OF POINTS ⋮ Remarks on the thickness of a graph ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ Constrained Point Set Embedding of a Balanced Binary Tree ⋮ Geometric Thickness in a Grid of Linear Area ⋮ A genetic algorithm for determining the thickness of a graph ⋮ Remarks on the thickness and outerthickness of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing an st-numbering
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Parallel concepts in graph theory
• Efficient Planarity Testing
• A Dual form of Kuratowski's Theorem
• The Thickness of the Complete Graph
• The Non-Biplanar Character of the Complete 9-Graph
• Every planar graph with nine points has a nonplanar complement
• How to Draw a Graph

This page was built for publication: On the thickness of graphs of given degree