Volume 293,
Number 1-3,
April 2005
19th British Combinatorial Conference
- Douglas R. Woodall:
Preface.
1-
- Guest editor listing.
3-
- Moncef Abbas, Sadek Bouroubi:
On new identities for Bell's polynomials.
5-10
- Ian Anderson, Leigh H. M. Ellison:
Z-cyclic ordered triplewhist tournaments on p elements, where p=5 (mod 8).
11-17
- Ian Anderson, Norman J. Finizio:
Some new Z-cyclic whist tournament designs.
19-28
- Ian Anderson, Donald A. Preece:
Some power-sequence terraces for Zpq with as few segments as possible.
29-59
- Kiyoshi Ando:
Trivially noncontractible edges in a contraction critically 5-connected graph.
61-72
- R. A. Bailey:
Balanced colourings of strongly regular graphs.
73-90
- Peter J. Cameron, Ian M. Wanless:
Covering radius for sets of permutations.
91-109
- Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel:
Ramsey degrees of bipartite graphs: A primitive recursive proof.
111-119
- Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian:
On the size of the minimum critical set of a Latin square.
121-127
- Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar:
Generalized subgraph-restricted matchings in graphs.
129-138
- M. Carmen Hernando, Tao Jiang, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
On the Steiner, geodetic and hull numbers of graphs.
139-154
- Fred C. Holroyd, Claire Spencer, John M. Talbot:
Compression and Erdös-Ko-Rado graphs.
155-164
- Fred C. Holroyd, John M. Talbot:
Graphs with the Erdös-Ko-Rado property.
165-176
- Leif K. Jørgensen:
Girth 5 graphs from relative difference sets.
177-184
- Nicolas Lichiardopol:
Independence number of iterated line digraphs.
185-193
- Tatsuya Maruta:
Extendability of quaternary linear codes.
195-203
- Philip Maynard, Johannes Siemons:
Efficient reconstruction of partitions.
205-211
- Nicholas C. K. Phillips, Donald A. Preece, Walter D. Wallis:
The seven classes of 5×6 triple arrays.
213-218
- José Luis Ruiz, Mercè Mora:
De Bruijn and Kautz digraphs of a rooted tree.
219-236
- Karen Seyffarth, Chengde Wang:
On eulerian and regular perfect path double covers of graphs.
237-250
- Rueiher Tsaur:
The Baillon-Simons theorems.
251-261
- Timothy R. Walsh:
Efficient enumeration of sensed planar maps.
263-289
- Igor E. Zverovich, Vadim E. Zverovich:
Basic perfect graphs and their extensions.
291-311
- Peter J. Cameron:
Research problems from the 19th British Combinatorial Conference.
313-320
Last update Tue Feb 14 04:16:59 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
