Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs

DOI10.5614/ejgta.2017.5.1.13zbMath1467.05051OpenAlexW2606576097MaRDI QIDQ5006611

Vladimir R. Rosenfeld

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2017.5.1.13

zbMATH Keywords

spanning treecubic graphcotreeretracting-free bidirectional circuit

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Deriving graphs with a retracting-free bidirectional double tracing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of spanning trees and Eulerian tours in iterated line digraphs
• Bidirectional retracting-free double tracings and upper embeddability of graphs
• Chords of longest cycles in cubic graphs
• Chromatic roots and Hamiltonian paths
• Hamilton cycles and eigenvalues of graphs
• Antiparallel \(d\)-stable traces and a stronger version of ore problem
• A problem regarding the tracing of graphs
• Strong Traces Model of Self-Assembly Polypeptide Structures
• A characterization of Hamiltonian prisms
• On Traversing Graphs

This page was built for publication: Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs