Bidirectional retracting-free double tracings and upper embeddability of graphs

DOI10.1016/0095-8956(90)90074-AzbMath0715.05054MaRDI QIDQ751672

Carsten Thomassen

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

double tracing; retracting; upper embeddability

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C75: Structural characterization of families of graphs

Related Items

The first eigenvalue of a Riemann surface, Searching for a strong double tracing in a graph