Bidirectional retracting-free double tracings and upper embeddability of graphs

DOI10.1016/0095-8956(90)90074-AMaRDI QIDQ751672zbMATH OpenFDO

Authors Carsten Thomassen

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0095-8956(90)90074-A

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)

Recommendations

• scientific article; zbMATH DE number 1218021
• scientific article; zbMATH DE number 4177080
• Deriving graphs with a retracting-free bidirectional double tracing
• Oriented walk double covering and bidirectional double tracing
• scientific article; zbMATH DE number 3918405

Cites work

• scientific article; zbMATH DE number 3857153 (Why is no real title available?)
• scientific article; zbMATH DE number 3825852 (Why is no real title available?)
• scientific article; zbMATH DE number 3904590 (Why is no real title available?)
• scientific article; zbMATH DE number 3750968 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• A new characterization of the maximum genus of a graph
• A note on upper embeddable graphs
• A problem regarding the tracing of graphs
• How to determine the maximum genus of a graph
• On Traversing Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Upper-embeddable graphs and related topics

Cited in

(9)

• Deriving graphs with a retracting-free bidirectional double tracing
• scientific article; zbMATH DE number 1218021 (Why is no real title available?)
• Searching for a strong double tracing in a graph
• Antiparallel \(d\)-stable traces and a stronger version of ore problem
• scientific article; zbMATH DE number 2147806 (Why is no real title available?)
• scientific article; zbMATH DE number 3918405 (Why is no real title available?)
• Traversing every edge in each direction once, but not at once: cubic (polyhedral) graphs
• The first eigenvalue of a Riemann surface
• Constructions of DNA and polypeptide cages based on plane graphs and odd crossing \(\pi \)-junctions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751672)