Cycles in digraphsâ•fi a survey Page 1 Cycles in DigraphsA Survey JC Bermond UNIVERSITE
PARIS- SUD C. Thomassen ORSAY, FRANCE MATEMATISK INSTITUT. AARHUS …

A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

In this paper we give necessary and sufficient conditions in order that K m, n (K m, n∗)
admits a decomposition into 2k-cycles (2k-circuits). This answers conjectures of JC Bermond …

An H-decomposition of a graph G=(V, E) is a partition of E into subgraphs isomorphic to H.
Given a fixed graph H, the H-decomposition problem is to determine whether an input graph …

The condition λv (v− 1)≡ 0 (mod 2m), v⩾ m+ 1 is obviously necessary for the existence of an
edge disjoint decomposition of a complete multigraph λK v into isomorphic simple paths …

GDECUMPOSIT~ON OF K,,, WHERE C HAS FOUR VERTICES OR LEM JC BERMOND J.
SCH~NHEIM The Utiiucrsity of Tel Aviv, Dqwtmenr 1. Intro Page 1 Discrete Mathematics 19 (IY77) …

AG‐design of order n is a decomposition of the complete graph on n vertices into edge‐
disjoint subgraphs isomorphic to G. We survey the current state of knowledge on the …

Publisher Summary Graph G (undirected or directed) can be decomposed into Hamiltonian
cycles or paths if one can partition its edges (arcs in the directed case) into Hamiltonian …

Three obvious necessary conditions for the existence of ak‐cycle system of order n are that if
n> 1 then n⩾ k, n is odd, and 2k divides n (n− 1). We show that if these necessary conditions …

G-designs and related designs Page 1 Discrete Mathematics 116 (1993) 299-311 North-Holland
299 G-designs and related designs Kazuhiko Ushio Department of Industrial Engineering …