
doi: 10.1007/pl00007219
handle: 11858/00-001M-0000-000F-37FA-0
The study of the thickness parameter for graphs is surveyed, both in terms of theoretical results and practical computation. Three heuristics for planarization are compared, the approach being to iteratively extract possibly large planar subgraphs until a planar subgraph remains.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), survey, planar subgraph, thickness, Planar graphs; geometric and topological aspects of graph theory
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), survey, planar subgraph, thickness, Planar graphs; geometric and topological aspects of graph theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 60 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
