Volume 50,
December 1998
- Johannes H. Hattingh, Michael A. Henning, Jacobus L. Walters:
Distance irredundance in graphs: complexity issues.
- Denis Hanson, C. O. M. Loten, Bjarne Toft:
On interval colourings of bi-regular bipartite graphs.
- Michele Mulazzani:
Stiff Genus of Groups.
- Pranava K. Jha, Sandi Klavzar:
Independence in Direct-Product Graphs.
- Dawn M. Jones, Denny James Roehm, Michelle Schultz:
On Matchings in Graphs.
- Zhi-Hong Chen:
Fan-Type Conditions for Collapsible Graphs.
- Suh-Ryung Kim, Fred S. Roberts:
The Elimination Procedure for the Competition Number.
- Sho Ishizuka:
Closure, Path-Factors and Path Coverings in Claw-Free Graphs.
- Alan C. H. Ling, Charles J. Colbourn:
Deleting Lines in Projective Planes.
- Jin Ho Kwak, Jaeun Lee:
Isomorphism classes of bipartite cycle permutation graphs.
- Iiro S. Honkala:
Combinatorial lower bounds on binary codes with covering radius one.
- Zdzislaw Grodzki, Aleksander Wronski:
Generalized de Bruijn multigraphs of rank k.
- Izak Broere, Jean E. Dunbar, Johannes H. Hattingh:
Minus k-subdomination in graphs.
- Purwanto, W. D. Wallis:
Minimum Order of a Graph with Given Deficiency and Either Minimum or Maximum Degree.
- Neville Robbins:
Some New Partition Identities.
- Noboru Hamada:
The Nonexistence of Ternary [231, 6, 153] Codes.
- Charles J. Colbourn, Jianxing Yin:
On Directed Incomplete Transversal Designs with Block Size Five.
- Béla Bollobás, Paul Erdös:
Graphs of Extremal Weights.
- Giorgio Faina, Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
The sizes k of the complete k-caps in PG(n, q), for small q and 3 <= n >= 5.
- Kishore Sinha, Byron Jones, Sanpei Kageyama:
A Series of quasi-multiple BIB Designs from Hadamard Matrices.
- Gaetano Quattrocchi:
Spanning Sets and Scattering Sets in Handcuffed Designs of order v and block size 3.
- S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Short Proofs of Theorems of Nash-Williams and Tutte.
- C. Pandu Rangan, K. R. Parthasarathy, V. Prakash:
On The g-centroidal Problem in Special Classes of Perfect Graphs.
- MingChu Li:
On Pancyclic Claw-Free Graphs.
- Gunnar Brinkmann, Eckhard Steffen:
Snarks and Reducibility.
- Uri Blass, Simon Litsyn:
Several new lower bounds for football pool systems.
- Thomas Hofmeister, Hanno Lefmann:
On k-Partite Subgraphs.
- Hongquan Yu, Tianming Wang:
An Inequality on Connected Domination Parameters.
- Olof Barr:
Properly Coloured Hamiltonian Paths in Edge-Coloured Complete Graphs without Monochromatic Triangles.
Copyright © Mon Dec 14 20:22:04 2009
by Michael Ley (ley@uni-trier.de)
