The Effect of Planarization on Width

DOI10.1007/978-3-319-73915-1_43zbMath1499.05428arXiv1708.05155OpenAlexW2963584485MaRDI QIDQ4625143

David Eppstein

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.05155

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Lower bounds for protrusion replacement by counting equivalence classes ⋮ Unnamed Item ⋮ The Effect of Planarization on Width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Graphs with small bandwidth and cutwidth
• Topologically sweeping an arrangement
• The vertex separation number of a graph equals its path-width
• Call routing and the ratcatcher
• Which crossing number is it anyway?
• Lower bounds for protrusion replacement by counting equivalence classes
• Square roots of minor closed graph classes
• On maximal planarization of nonplanar graphs
• An analysis of heuristics for graph planarization
• The Effect of Planarization on Width
• Planar Induced Subgraphs of Sparse Graphs
• On the Relationship Between Clique-Width and Treewidth
• The crossing number of K5,n
• On the undecidability of finite planar graphs
• On a problem of P. Turan concerning graphs

This page was built for publication: The Effect of Planarization on Width