Bidirectional retracting-free double tracings and upper embeddability of graphs
From MaRDI portal
Publication:751672
DOI10.1016/0095-8956(90)90074-AzbMATH Open0715.05054MaRDI QIDQ751672FDOQ751672
Authors: Carsten Thomassen 
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Cites Work
- On the Problem of Decomposing a Graph into n Connected Factors
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to determine the maximum genus of a graph
- Title not available (Why is that?)
- A new characterization of the maximum genus of a graph
- Title not available (Why is that?)
- Upper-embeddable graphs and related topics
- A problem regarding the tracing of graphs
- Title not available (Why is that?)
- A note on upper embeddable graphs
- On Traversing Graphs
Cited In (9)
- Deriving graphs with a retracting-free bidirectional double tracing
- Title not available (Why is that?)
- Searching for a strong double tracing in a graph
- Antiparallel \(d\)-stable traces and a stronger version of ore problem
- Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
