Algebraic characterizations of outerplanar and planar graphs

H. Holst, van der

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)

Abstract

A drawing of a graph in the plane is even if nonadjacent edges have an even number of intersections. Hanani’s theorem characterizes planar graphs as those graphs that have an even drawing. In this paper we present an algebraic characterization of graphs that have an even drawing. Together with Hanani’s theorem this yields an algebraic characterization of planar graphs. We will also present algebraic characterizations of subgraphs of paths, and of outerplanar graphs.
Original languageEnglish
Pages (from-to)2156-2166
JournalEuropean Journal of Combinatorics
Volume28
Issue number8
DOIs
Publication statusPublished - 2007

Fingerprint

Dive into the research topics of 'Algebraic characterizations of outerplanar and planar graphs'. Together they form a unique fingerprint.

Cite this