To retrieve the abstracts in dvi mode mc4abstracts.dvi

To retrieve the abstracts in ps mode mc4abstracts.ps


TENTATIVE SCHEDULE: (See below for titles of talks)

 

THURSDAY, Oct. 14, 1999

 9:30-10:30 a.m. Registration & Morning Tea
 10:30-10:50 a.m. Official Opening & Welcome
 11:00-11:55 a.m. van Rees, J.
 12:00-1:30 p.m. Lunch
 1:30-2:25 p.m. Rodger
 2:30-3:00 p.m. Afternoon Tea
 3:00-3:20 p.m.
 3:30-3:50 p.m.
 4:00-4:20 p.m.
 4:30-4:50 p.m.
 Dean  Kocay
 Nelson  Dankelmann
 Roblee  Bonato
 Jha  Abueida
  Dinner (personal arrangements)
 7:00-9:00 p.m. Welcome Reception

 

FRIDAY, Oct. 15, 1999

 8:30-9:00 a.m. Registration (continued) & Coffee
 9:00-9:20 a.m.
 9:30-9:50 a.m.
 10:00-10:20 a.m.
 Lee  Harborth
 Chen, Z.  Johnson
 Wallis  Kundgen
 10:30-11:00 a.m. Morning Tea
 11:00-11:55 a.m. Gallian
 12:00-1:30 p.m. Lunch
1:30-2:25 p.m. Janssen
 2:30-3:00 p.m. Afternoon Tea
 3:00-3:20 p.m.
 3:30-3:50 p.m.
 4:00-4:20 p.m.
 Wojdylo  Chen, Y.
 Peled Raines
 Schaffer  Gunawardena
 4:30-5:00 p.m. Business Session

Friday, 6:30 p.m. Conference Banquet

 

SATURDAY, Oct. 16, 1999

 8:30-9:00 a.m. Registration (continued) & Coffee
9:00-9:20 a.m.
9:30-9:50 a.m.
 10:00-10:20 a.m.
 Dios  Heuss
 Martin  Chappell
 Vanden Eynden  Zhao
 10:30-11:00 a.m. Morning Tea
 11:00-11:55 a.m. Rees, R.
12:00-1:30 p.m. Lunch
  1:30-2:25 p.m. Kreher
  2:30-3:00 p.m. Afternoon Tea
 3:00-3:20 p.m.
 3:30-3:50 p.m.
 4:00-4:20 p.m.
 
 Jiang  Ishigami
 Ramamurthi  Punnim
  Korolev  Eggleton
   
 7:30 p.m.- Survivors' Party


Thursday Morning, 11:00-11:55 a.m., Invited Lecture #1, STV 401
VAN REES, JOHN
ENUMERATION OF INEQUIVALENT BINARY SELF-DUAL CODES OF LENGTH 32 AND 34.


Thursday Afternoon, 1:30-2:25 p.m., Invited Lecture #2, STV 401
RODGER, CHRISTOPHER A.
AMALGAMATIONS OF GRAPHS.


Thursday Afternoon, 3:00-4:50 p.m., Contributed Talks, Session #1, 
STV 401 & STV 401A
Dean, Nathaniel
The number of unit distances.

Kocay, William
Software for drawing graphs on the torus.

Nelson, Patricia
Maximum independent sets of small size: preliminary results.

Dankelmann, Peter 
How to find a MAD tree.

Roblee, Ken
A characterization of an extremal family of triangle-free graphs.

Bonato, Anthony 
On the $n$-e.c. line-critical graphs.

Jha, Pranava K.
Smallest independent dominating sets in products of cycles.

Abueida, Atif 
Embedding incomplete latin squares of order $n$ in idempotent latin squares of order $2n$.


Friday Morning, 9:00-10:20 a.m., Contributed Talks, Session #2, 
STV 401 & STV 401A
Lee, Sin-Min
Supermagicness of regular complete $k$-partite graphs.

Harborth, Heiko
Game board Ramsey numbers.

Chen, Zhibo
Some results from labeling graphs.

Johnson, Peter D.
A newly-discovered lemma in search of applications in Ramsey theory.

Wallis, Walter D.
Magic labelings.

Kundgen, Andre
On a generalized Anti-Ramsey problem.


Friday Morning, 11:00-11:55 a.m., Invited Lecture #3, STV 401
GALLIAN, JOSEPH
GRAPH LABELINGS.


Friday Afternoon, 1:30-2:25 p.m., Invited Lecture #4, STV 401
JANSSEN, JEANNETTE
LIST-COLOURINGS OF EDGES AND THE ASYMPTOTICS OF VIZING'S CONJECTURE.


Friday Afternoon, 3:00-4:20 p.m., Contributed Talks, 
Session #3, STV 401 & STV 401A
Wojdylo, Jerzy
Presuperschemes and colored directed graphs.

Chen, Yachen
The Kneser graph $K(n,k)$ is Hamiltonian for $n \geq 3k$.

Peled, Uri
Degree sequences with majorization gap 1 have Hamiltonian realization graphs.

Raines, Michael E.
Equitable partial cycle systems.

Schaffer, Karl
Some $k$-fold edge-graceful labelings of graphs with $p$ vertices and $p-1$ edges.

Gunawardena, Athula
On isomorphism invariants in finite orthogonal spaces.


Saturday Morning, 9:00-10:20 a.m., Contributed Talks, Session #4, 
STV 401 & STV 401A
Dios, R.
On orthogonal arrays.

Heuss, Sarah H.
A generalization on the Oberwolfach problem, or resolvably decomposing complete multipartite graphs into cycles.

Martin, William J.
Intersection properties for configurations in symmetric designs.

Chappell, Glenn
Transversals in "Generalized Matrices".

Vanden Eynden, Charles
Factorizations of and by powers of complete graphs.

Zhao, Cheng
The total chromatic number of some join graphs.


Saturday Morning, 11:00-11:55 a.m., Invited Lecture #5, STV 401
REES, ROLF S.
A SURVEY OF RESULTS ON MANDATORY REPRESENTATION DESIGNS.


Saturday Afternoon, 1:30-2:25 p.m., Invited Lecture #6, STV 401
KREHER, DONALD
COVERING ARRAYS OF STRENGTH 3.


Saturday Afternoon, 3:00-4:20 p.m., Contributed Talks, Session #3, 
STV 401 & STV 401A
Jiang, Tao
Rainbow trees in edge-colorings of graphs.

Ishigami, Yoshiyasu
Cycles passing through specified edges in balanced bipartite graphs.

Ramamurthi, Radhika
Face-coloring problems for planar graphs (preliminary report).

Punnim, Narong
On $F(j)$-graphs and their applications.

Korolev, Peter S.
Coding of plane bicolored trees with two selected vertices of different colors.

Eggleton, Roger B. 
Minimally star-saturated graphs.