Copyright © Mon Nov 2 21:33:22 2009
by Michael Ley (firstname.lastname@example.org)
- R. Balakrishnan, P. Paulraja:
Hamilton cycles in tensor product of graphs.
- R. Balakrishnan, R. Sampathkumar, V. Yegnanarayanan:
Extremal graphs in some coloring problems.
- Jean Bevis, Michael Grady:
Toroidal maps of modular quotient groups.
- N. S. Bhave:
Characterisation of potentially generalised bipartite self-complementary bi-graphic sequences.
- Béla Bollobás, Tamás Szabó:
The oriented cycle game.
- F. Buekenhout, M. Parker:
The number of nets of the regular convex polytopes in dimension <= 4.
- Ciping Chen:
Matchings and matching extensions in graphs.
- Florence Forbes, Bernard Ycart:
Counting stable sets on Cartesian products of graphs.
- T. Gangopadhyay:
Packing graphs in their complements.
- Robert Gill:
The number of elements in a generalized partition semilattice.
- G. Greco:
Capacities of graphs and 2-matchings.
- Michael A. Henning:
Packing in trees.
- Guoping Jin:
The number of complete subgraphs of equi-partite graphs.
- D. Klabjan, Bojan Mohar:
The number of matchings of low order in hexagonal systems.
- Keiko Kotani:
K-regular factors and semi-k-regular factors in graphs.
- Esther R. Lamken:
The existence of KS3(v; 2, 4).
- Terri Lindquester, Nicholas C. Wormald:
Factorisation of regular graphs into forests of short paths.
- András Lukács, Norbert Seifter:
Lattices in graphs with polynomial growth.
- Ilene H. Morgan:
Construction of complete sets of mutually equiorthogonal frequency hypercubes.
- S. Neufeld, R. Nowakowski:
A game of cops and robbers played on products of graphs.
- Branimir Seselja, Andreja Tepavcevic:
On generation of finite posets by meet-irreducibles.
- Gregory Gutin:
A note on the cardinality of certain classes of unlabeled multipartite tournaments.
- Oleg V. Borodin:
Triangulated 3-polytopes without faces of low weight.
- Y.-G. Chen:
A theorem on harmonic sequences.
- Michael Klugerman, Alexander Russell, Ravi Sundaram:
On embedding complete graphs into hypercubes.
- Andreas Brandstädt: