Volume 122, Numbers 1-3, November 1993
, M. Sen
: An interval digraph in relation to its associated bipartite graph.
Clelia de Felice
: A partial result about the factorization conjecture for finite variable-length codes.
T. C. Enns
: Hamiltonian circuits and paths in subset graphs with circular adjacency.
Alexander V. Ivashchenko
: Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs.
: A counter-example to a conjecture relating complete sets of frequency squares and affine geometries.
Arthur T. White
: Treble dodging minor methods: ringing the cosets, on six bells.
: On path factorizations of complete multipartite graphs.
: An upper bound for the radius of a 3-connected graph.
: Some remarks on minimal bases and maximal nonbases of integers.
: On the size of graphs with all cycle having distinct length.
: A counterexample to a conjecture on the bondage number of a graph.