Volume 46,
August 1997
- Mark Ramras:
Fundamental Subsets of Edges of Hypercubes.
- Ulrich Teschner:
On the bondage number of block graphs.
- R. Bodendiek, G. Walther:
(a, d)-Antimagic Parachutes II.
- Peter Horák, Nicholas C. K. Phillips, Walter D. Wallis, Joseph L. Yucas:
Counting frequencies of configurations in Steiner Triple Systems.
- Josef Lauri:
Pseudosimilarity in Graphs - A Survey.
- Manoel Lemos:
Non-binary matroids having four non-binary elements.
- Lowell W. Beineke, Wayne Goddard, Marc J. Lipman:
Graphs with Maximum Edge-Integrity.
- Lane H. Clark, Thomas Dale Porter:
On the Maximum Number of Chords in a Cycle of a Graph.
- Ralph Gordon Stanton:
Ryser Designs.
- Timothy R. Walsh:
Worst-Case Analysis of Read's Chromatic Polynomial Algorithm.
- A. Antonysamy, G. Arumugam, C. Xavier:
An Algorithm To Find The Core Of A CV-Graph.
- Peter Danziger:
Uniform Restricted Resolvable Designs with r = 3.
- Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba:
On Graphs With a Unique Least Common Multiple.
- Marialuisa J. de Resmini:
On the classical semitranslation plane of order 16.
- Bert Randerath, Lutz Volkmann:
Simplicial Graphs and Relationships to Different Graph Invariants.
- Michael O. Albertson:
The Irregularity of a Graph.
- Guantao Chen, Yiping Liu:
Hamiltonian Graphs with Large Neighborhood Unions.
- R. P. Swaminathan:
On a Class of Graphic Matrices.
- Xuding Zhu:
A note on graph reconstruction.
- R. Yilmaz, Ibrahim Cahit:
E-cordial Graphs.
- Dragos Cvetkovic:
A graph theoretical procedure for clustering binary vectors.
- Thomas Niessen:
A Fan-Type Result for Regular Factors.
- Charles Vanden Eynden:
Decomposition of Complete Bipartite Graphs.
- Alfred Geroldinger, Rudolf Schneider:
On Minimal Zero Sequences With Large Cross Number.
- Kiyoshi Ando, Hideo Komuro:
The seven graphs whose H-transformations are uniquely determined.
Copyright © Wed Dec 23 21:48:14 2009
by Michael Ley (ley@uni-trier.de)
