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

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

A {\em retracting-free bidirectional circuit} in a graph $G$ is a closed walk which traverses every edge exactly once in each direction and such that no edge is succeeded by the same edge in the opposite direction. Such a circuit revisits each vertex only in a number of steps. Studying the class $\m...

Full description

Saved in:
Bibliographic Details
Main Author: Rosenfeld, Vladimir R.; Department of Computer Science and Mathematics, Ariel University, Ariel 40700, Israel (Author)
Other Authors: Ministry of Absorption of the State Israel (through fellowship "Shapiro") (Contributor)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2017-04-10.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items