Atlas home || Conferences | Abstracts | about Atlas

Abstracts

This is an archive of abstracts accepted to this conference. For more listing and sorting options, see the active list.

Michael Albert The game of End-Nim
R.E.L. Aldred M-alternating paths in n-extendable bipartite graphs
Watcharaphong Ananchen On The Adjacency Properties of Generalized Paley Graphs.
Nawarat Ananchuen On a Minimum Cutset of Strongly k-Extandable Graphs
Steven Archer Near Varieties of Matroids
Hilda Assiyatun independent sets and 2-independent sets in random d-regular graphs
Mike Atkinson Sorting with stacks in series
Sheng Bau The decycling number of graphs
Richard Bean A census of critical sets in the latin squares of order at most six
Frank E. Bennett On the Existence of Four MOLS with Equal-sized Holes
Elizabeth J. Billington Metamorphosis of designs with block size four: a survey and the final case
Ljiljana Brankovic Combinatorics and Database Security
Nicholas J Cavenagh The size of the smallest latin interchange in a back circulant latin square.
Diana Combe Bhaskar Rao Designs and the Alternating Group A₄
Dave Elkin Short Paths in Regular Graphs
Hideaki Fujimoto Balanced t-foil decomposition of complete graphs
David G Glynn Some Results about Quantum Codes
Catherine Greenhill The relative complexity of approximate counting problems
Manish K. Gupta On Z₄ Codes Satisfying the Chain Condition
Rhiannon Hall Excluded Minors for the Matroids of Branch-Width 3
Angele Hamel Symplectic tableaux, alternating sign matrices, and Weyl's denominator formula for sp(2n)
Petr Hliněný Fractional flow number of a matroid
Joan P. Hutchinson On Rectilinear and Polar Visibility Graphs
Robert Jajcay Representing finite groups as regular automorphism groups of combinatorial structures
Abdollah Khodkar On the spectrum of Critical sets in back circulant latin squares
Midori Kobayashi Dudeney's Round Table Problem
Tri Atmojo Kusmayadi Extremal Problems Concerning Cycles in Graphs
Curt Lindner A partial 8-cycle system of order n can be embedded in an 8-cycle of order at most 4n+29
Charles Little Two invariants for adjointly equivalent graphs
Brendan D. McKay Graphs with degrees less than n/2
J.W. Moon On the Centroid of Recursive Trees
Michael Morley A cyclic covering design with block size five on 15 points
Eunice Mphako Martin Type polynomials of Graphs and Matroids
Kari J. Nurmela Lower bounds on 2-covering arrays by exhaustive search
Andrew Oppenheim Counting parallelogram polyominoes on the triangular lattice
Tomaz Pisanski Growth in Products of Graphs
Tiang Poomsa-ard On k+1 separation of graphs by removal edges
Chris Rodger Amalgamations of Graphs
Frank Ruskey Euclidean Strings
Jozef Širáň Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
Ralph G. Stanton Minimal PBDs with Specified Longest Block Length
Gunter Steinke Laguerre near-planes and orthogonal arrays-a classification of Laguerre near-planes of order 4
Anne Penfold Street Partitioning sets of triples into small planes
Kee L Teo Zeros of Adjoint Polynomials of Paths and Cycles
Robin Thomas Can the strong perfect graph conjecture be proved?
Thomas Tucker Sizings of groups
Kazuhiko Ushio Evenly partite bigraph-factorization of symmetric complete tripartite multi-digraphs
Mark E. Watkins Bilinski maps and construction of geodesics
Geoff Whittle Branch width and well-quasi-ordering in matroids and graphs

© 2006 Atlas Conferences Inc.