Volume 43,
August 1996
- Katherine Heinrich, Midori Kobayashi, Gisaku Nakamura:
A solution of Dudeney's round table problem for p^eq^f + 1.
- Sanpei Kageyama, Ying Miao:
Some constructions of semiframes.
- Lin Ke-Rong, Rong-si Chen:
K-coverable polyhex graphs.
- T. Gangopadhyay:
On the existence of a stable complementing permutation in t-sc graph.
- Chen Kejun, Zhu Lie:
On the existence of skew room frames of type t^u.
- Ulrich Teschner:
The bondage number of a graph G can be much greater than Delta(G).
- S. Arumugam, A. Thuraiswamy:
Total domination in graphs.
- M. C. Soper:
A semigroup operation using powers of two.
- Zeng Min Song, Ke Min Zhang:
A new idea for Hamiltonian problem.
- Kathrin Klamroth, Ingrid Mengersen:
Ramsey numbers of K3 versus (p, q)-graphs.
- Esther R. Lamken:
A few more partitioned balanced tournament designs.
- John T. Thorpe, Frederick C. Harris Jr.:
A parallel Stochastic optimization algorithm for finding mappings of the rectilinear minimal crossing problem.
- Johann Hagauer, Sandi Klavzar:
On independence numbers of the cartesian product of graphs.
- Huaitang Chen, Kejie Ma, Huishan Zhou:
The ascending star subgraph decomposition of some star forests.
- Margaret B. Cozzens, Shu-Shih Y. Wu:
Vertex-neighbor-integrity of trees.
- Odile Favaron, Christina M. Mynhardt:
On the sizes of least common multiples of several pairs of graphs.
- Oleg V. Borodin:
To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs.
- Ludovít Niepel, Martin Knor, Lubomír Soltés:
Distances in iterated line graphs.
- Antoni Marczyk:
Hamiltonian cycles in the square of two-connected graph with given circumference.
- Abdollah Khodkar:
The fine structure of (v, 3) directed triple systems: v = 0 or 1 (mod 3).
- Hajo Broersma, Xueliang Li:
The connectivity of the leaf-exchange spanning tree graph of a graph.
- Qing-Xue Huang:
Complete m-partite decompositions of complete multigraphs.
- Ernest J. Cockayne, Christina M. Mynhardt:
On a generalization of signed dominating functions of graphs.
- Martin Knor:
Characterization of minor-closed pseudosurfaces.
- Jinjiang Yuan:
Path-width and tree-width of the join of graphs.
- Michael A. Henning:
Domination in regular graphs.
- Carlos Guia, Oscar Ordaz:
Chvatal-Erdos condition for Hamiltonicity in digraphs.
Copyright © Fri Dec 4 20:27:17 2009
by Michael Ley (ley@uni-trier.de)
