Algebraic characterizations of outerplanar and planar graphs

H. Holst, van der

doi:10.1016/j.ejc.2007.04.005

Algebraic characterizations of outerplanar and planar graphs

H. Holst, van der

Combinatorische Optimalisering - EIDMA

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

5 Citaten (Scopus)

Samenvatting

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.

Originele taal-2	Engels
Pagina's (van-tot)	2156-2166
Tijdschrift	European Journal of Combinatorics
Volume	28
Nummer van het tijdschrift	8
DOI's	https://doi.org/10.1016/j.ejc.2007.04.005
Status	Gepubliceerd - 2007

Toegang tot document

10.1016/j.ejc.2007.04.005

Vingerafdruk Duik in de onderzoeksthema's van 'Algebraic characterizations of outerplanar and planar graphs'. Samen vormen ze een unieke vingerafdruk.

Citeer dit

@article{2d901783c8644bfe9a914be2d909b3b2,

title = "Algebraic characterizations of outerplanar and planar graphs",

abstract = "A drawing of a graph in the plane is even if nonadjacent edges have an even number of intersections. Hanani{\textquoteright}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{\textquoteright}s theorem this yields an algebraic characterization of planar graphs. We will also present algebraic characterizations of subgraphs of paths, and of outerplanar graphs.",

author = "{Holst, van der}, H.",

year = "2007",

doi = "10.1016/j.ejc.2007.04.005",

language = "English",

volume = "28",

pages = "2156--2166",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press Inc.",

number = "8",

}

TY - JOUR

T1 - Algebraic characterizations of outerplanar and planar graphs

AU - Holst, van der, H.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

U2 - 10.1016/j.ejc.2007.04.005

DO - 10.1016/j.ejc.2007.04.005

M3 - Article

VL - 28

SP - 2156

EP - 2166

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 8

ER -