EuDML | Browse

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

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

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 – 6 of 6

Balanced Gray codes.

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

The Electronic Journal of Combinatorics [electronic only]

Balanced path decomposition of $λ K_{n, n}$ and $λ K_{n, n}^{*}$

Hung-Chih Lee, Chiang Lin (2009)

Czechoslovak Mathematical Journal

Let $P_{k}$ denote a path with $k$ edges and $ł K_{n, n}$ denote the $ł$ -fold complete bipartite graph with both parts of size $n$ . In this paper, we obtain the necessary and sufficient conditions for $ł K_{n, n}$ to have a balanced $P_{k}$ -decomposition. We also obtain the directed version of this result.

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]

Boolean graphs

Juhani Nieminen (1988)

Commentationes Mathematicae Universitatis Carolinae

Brève communication. Une nouvelle méthode de marquage dans la recherche d'une chaîne de longueur maximale d'un arbre

Y. Kergall (1980)

RAIRO - Operations Research - Recherche Opérationnelle

Currently displaying 1 – 6 of 6

Page 1