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 tracingretractingupper embeddability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (6)

Deriving graphs with a retracting-free bidirectional double tracing ⋮ Constructions of DNA and polypeptide cages based on plane graphs and odd crossing \(\pi \)-junctions ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ Searching for a strong double tracing in a graph ⋮ The first eigenvalue of a Riemann surface ⋮ Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs

Cites Work

• How to determine the maximum genus of a graph
• Upper-embeddable graphs and related topics
• A problem regarding the tracing of graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• A note on upper embeddable graphs
• A new characterization of the maximum genus of a graph
• On Traversing Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bidirectional retracting-free double tracings and upper embeddability of graphs