Indexed metadata
Re-embeddings of Maximum 1-Planar Graphs
Yusuke Suzuki
Source abstract
In this paper, we examine the re-embeddability of maximum 1-planar graphs. In particular, we prove that every optimal 1-planar graph is uniquely 1-embeddable on the sphere except for a sequence of graphs that are minimal with respect to certain reductions. These optimal 1-planar graphs are closely related to their quadrangular subgraphs. We also give a generating theorem for optimal 1-planar graphs.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.