Succinct Planar Encoding with Minor Operations

Frank Kammer, Johannes Meintrup

Let $G$ be an unlabeled planar and simple $n$-vertex graph. Unlabeled graphs are graphs where the label-information is either not given or lost during the construction of data-stru…