Unified Hanani-Tutte theorem

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10366175" target="_blank" >RIV/00216208:11320/17:10366175 - isvavai.cz</a>

Result on the web

<a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p18" target="_blank" >http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p18</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Unified Hanani-Tutte theorem

Original language description

We introduce a common generalization of the strong Hanani-Tutte theorem and the weak Hanani-Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani-Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10101 - Pure mathematics

Project

<a href="/en/project/GJ16-01602Y" target="_blank" >GJ16-01602Y: Topological and geometric approaches to classes of permutations and graph properties</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Electronic Journal of Combinatorics

ISSN

1077-8926

e-ISSN

—

Volume of the periodical

24

Issue of the periodical within the volume

3

Country of publishing house

US - UNITED STATES

Number of pages

8

Pages from-to

—

UT code for WoS article

000414864200002

EID of the result in the Scopus database

2-s2.0-85027074712