EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Cxx Graph theory
05C45 Eulerian and Hamiltonian graphs

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 7 of 7

Balanced Gray codes.

Bhat, Girish S., Savage, Carla D. (1996)

The Electronic Journal of Combinatorics [electronic only]

Balancing cyclic $R$ -ary Gray codes.

Flahive, Mary, Bose, Bella (2007)

The Electronic Journal of Combinatorics [electronic only]

Balancing cyclic $R$ -ary Gray codes. II.

Flahive, Mary (2008)

The Electronic Journal of Combinatorics [electronic only]

Bent Hamilton cycles in $d$ -dimensional grid graphs.

Ruskey, F., Sawada, Joe (2003)

The Electronic Journal of Combinatorics [electronic only]

Binary Gray codes with long bit runs.

Goddyn, Luis, Gvozdjak, Pavol (2003)

The Electronic Journal of Combinatorics [electronic only]

Bipartite diametrical graphs of diameter 4 and extreme orders.

Al-Addasi, Salah, Al-Ezeh, Hasan (2008)

International Journal of Mathematics and Mathematical Sciences

Bounds of lengths of open Hamiltonian walks

Pavel Vacek (1992)

Archivum Mathematicum

If $G$ is a graph, an open Hamiltonian walk is any open sequence of edges of minimal length which includes every vertex of $G$ . In this paper bounds of lengths of open Hamiltonian walks are studied.

Currently displaying 1 – 7 of 7

Page 1