1999 Combinatorics, Graph Theory and Computing Conference

1999 Combinatorics, Graph Theory

and Computing Conference

Invited talks

Martin Aigner. University of Berlin. Penrose Polynomials and the 4-Color Theorem.
Tuesday 2:00 pm.

Lazlo Babai, University of Chicago. Constructing Ramsey Graphs: an Erdos Challenge.
Thursday, 9:30 am.

David Bressoud , Dewitt Wallace Professor, Macalester College, The Story of the Alternating Sign Matrix Conjecture 1: determinants, plane partitions and symmetric functions, and 2: symmetric designs, Pfafffians, and the Yang-Baxter Equation..
Monday, 9:30 am and 2:00 pm.

Jeff Dinitz, University of Vermont, Coloring Block Designs.
Wednesday, 9:30 am.

Brendan McKay, Australian National University. Constructing Combinatorial Objects on the Computer.
Wednesday, 2:00 pm.

Brendan McKay, Australian National University. Special Public Lecture: Bible codes: Fact or Fallacy?
Thursday, 4:30 pm.

Andrew Odlyzko, A.T.&T. Laboratories-Research. Random Permutations, Computers and Quantum Gravity.
Thursday, 2:00 pm.

Ann Trenk, Wellesley College. Seventeen Years of Tolerance Graphs.
Tuesday, 9:30 am.

Scott Vanstone, University of Waterloo and CERTICOM Corporation. Recent Advances in Elliptic Curve Cryptography.
Friday, 9:30 am.

Contributed talks

204: A. Abdalla, N. Deo, R. Franceschini, Parallel Heuristics for the Diameter-Constrained MST Problem

139: A. Abueida, C. A. Rodger, Embedding of Incomplete Latin Squares of Order n in an Idempotent Latin Square of Order 2n

051: Michael O. Albertson, Symmetry Breaking in Graphs - 5 Years Later

055: Michael O. Albertson, Emily H. Moore, Extending Graph Colorings Using No Extra Colors

184: A. A. Ali, S. Y. Alsardary, On the Basis Number of a Graph

061: Hesham H. Ali, Raj Vemulapalli, On Scheduling Partially Ordered Tasks in Distributed Systems

028: Tom Altman, Connectivity and Reliable Communication for Replicating Graphs

216: A. T. Amin, On Optimal Acyclic Orientations of a Graph

187: M. Atici, Small Hash Families

001: Jay S. Bagga, John W. Emert, J. Michael McGrew, Some Properties of Directed Polygon Visibility Graphs

009: Bela Bajnok, Sidon-type Sequences and Spherical 3-Designs

107: J. Balogh, B. Bollobas, D. Weinreich, Minimal and Aberrant Hereditary Properties of Graphs

111: J. Balogh, B. Bollobas, D. Weinreich, The Growth of Hereditary Properties of Graphs

176: R. Barbosa, On 1-Zm-well-covered and strongly Zm-well-covered Graphs

203: A. Bargteil, W. Gasarch, The Search for an Honest Man

178: M. V. Barovich, Long Paths through Specified Vertices in a 2-connected Graph

078: Nils R. Barth, Anant P. Godbole, Camilia Smith, The Multiplicity of Parts in an Integer Composition and a Theorem of Szekeres

030: M. Bartha, M. Kresz, Characterising Deterministic Soliton Graphs

013: Lynn Margaret Batten, Decompositions of Finite Projective Planes

118: L. W. Beineke, O. R. Oellermann, R. E. Pippert, The Average Connectivity of A Graph

154: F. E. Bennett, H. Zhang, L. Zhu, Holey Steiner Pentagon Systems and Related Designs

177: D. R. Berman, S. C. McLaurin, D. D. Smith, Tournaments for Teams with t Players

027: Jurgen Bierbrauer, From Algebraic-Geometric Codes to Limited Bias and Dependence

025: Jens-P. Bode, Independent Knights on Hexagonal Boards

169: K. P. Bogart, L. H. Montague, Join Congruence Relations on Geometric Lattices

070: Kenneth P. Bogart, Threshold Representations of Ordered Sets and Unbounded Tolerance Graphs

119: T. Bohme, B. Mohar, Labeled K2,t-Minors in 3-Connected Planar Graphs

094: C. Paul Bonnington, Marston Conder, Patricia McKenna, Margaret Morton, Embedding Digraphs on Orientable Surfaces

168: S. G. Boswell, R. B. Eggleton, J. A. MacDougall, Minimally Path-Saturated Graphs

082: Kaddour Boukaabar, Distances on Subsets of a Finite Set

117: J. Boyer, W. Myrvold, Stop Minding your P's and Q's: A Simplified O(n) Planar Embedding Algorithm

144: R. C. Brigham, J. R. Carrington, R. P. Vitray, J. Yellen, Achievable Sequences for Independent Domination in Connected Graphs

038: Robert C. Brigham, Kathleen G. Cherry, LineGCS of trees

128: R. C. Brigham, R. D. Dutton, Binary Trees Partitions

059: Richard A. Brualdi, Susan Hollingsworth, Large Multicolored Forests in Complete Bipartite Graphs

143: M. Buratti, New Results on Regular and 1-Rotational Designs

095: M. Buratti, F. Zuanni, Enumeration of 1-Rotational Steiner 2-Designs of Small Order

104: A.P. Burger and C. M. Mynhardt, An Upper Bound for the Domination Number of the Queens Graph

149: N. Calkin, Factorizing the Generalized Vandermonde Matrix

182: K. Cameron, J. Edmonds, Some Graphic Uses of an Even Number of Odd Nodes

213: N. A. Carella, On the Coefficients of Polynomials in Finite Fields

193: N. P. Carnes, Two Cycle Antiautomorphism of Mendelsohn Triple Systems

046: Marcia R. Cerioli, Jayme L. Szwarcfiter, Edge Clique Graphs of some Classes of Chordal Graphs

220: A. Chan, W. Gasarch, C. Kruskal, Finding the Same Number Twice

072: Glenn Chappell, A Higher-Dimensional Generalization of Rota's Colorful Conjecture

077: Gary Chartrand, Just How Good Is That Bound?

097: Gary Chartrand, David Erwin, Michael Raines, Ping Zhang, Orientation Distance Graph

101: Gary Chartrand, Ping Zhang, The Steiner Number and Steiner Sets in Graphs

147: M. A. Chateauneuf, C. J. Colbourn, D. L. Kreher, E. R. Lamken, D. C. Torney, Pooling, Lattice Square and Union Jack Designs

018: G. Chen, R. Faudree. W. Shreve, Clique-Dominating Cycles

053: Xiao Chen, Jie Wu, Fault-Tolerant Multicasting in 3-D Meshes Using Extended Safety Levels

016: Eddie Cheng, Marc Lipman, Fault Tolerant Routing in Split Stars and Alternating Group Graphs

020: Eddie Cheng, Marc Lipman, Disjoint Paths in Split Stars

021: Hee Lin Cheng, Peter Che Bor Lam, Wai Chee Shiu, Knight's Tour on a Hexagonal Honeycomb

191: P. Z. Chinn, W. C. Chinn, S. Shumays, A Mathematical Moment in Music

050: Phyllis Z. Chinn, Ralph P. Grimaldi, Tilings and Patterns of Enumeration

189: D. V. Chopra, Some Results on Orthogonal Arrays

043: Edwin Clark and Stephen Suen, On the Probability that a t-Subset of a Finite Vector Space Contains an r-Subspace - with Applications to Short, Light Codewords in a BCH Code

194: K.L. Clark, J.D. Key, Geometric Codes over Fields of Odd Prime Power Order

096: Ernie Cockayne, Devon McCrea, Christine Mynhardt, Nordhaus-Gaddum results for CO-irredundance in Graphs

068: Jenifer Corp, Jenny McNulty, On Balance Preserving Matroid Operations

145: L Riccio, C. J. Colbourn, An Upper Bound for Disjunct Matrices

114: A. Czygrinow, G. H. Hurlbert, H. A. Kierstead, W. T. Trotter, A Note on Graph Pebbling

174: M. Daven, C. A. Rodger, Maximal Sets of Hamiltonian Cycles in Complete Multipartite Graphs

133: G. J. Davis, G. S. Domke, Ranks of Circulant Graphs

102: Nathaniel Dean, Drawing graphs on a Sphere

200: N. Deo, P. Micikevicius, A Heuristic for a Leaf Constrained Minimum Spanning Tree Problem

231: Peng Ding, The Minimum-weight Codewords in the Dual Binary Code of the Design PG_m,m-1(F_q)

103: E. Dobson, Packing Trees into the Complete Graph

156: F. Doherty, J. R. Lundgren, Chromatic Number and Planarity of Domination-Compliance Graphs

127: F. Doherty, J. R. Lundgren, D. Siewert, Biclique Covers and Partitions of Bipartite Graphs and Digraphs and Related Matrix Ranks of {0,1}-Matrices

034: Ted Doyle, Jean Dunbar, Steve Hedetniemi, Sandee Hedetniemi, David Jacobs, Renu Laskar, Alice McRae, Douglas Rall, The Equal Union Property on Vertex Sets in a Graph

080: Jean E. Dunbar, Teresa W. Hhaynes, Linda Lawson, To Change or Not To Change

221: C. E. Ealy, On the Genus of Finite Loops

153: M. L. Gargano, W. Edelson, A Fibonacci Survival Indicator for Efficient Fitness Calculation in Genetic Paradigms

179: O. Egecioglu, A. King, Randon Walks and Catalan Factorization

098: Joanna A. Ellis-Monaghan, New Results for the Martin Polynomial

132: E. S. Elmallah, L. K. Stewart, On Parameterizing Circle Graphs

134: H. Enomoto, A. Kaneko, A. Kelmans, T. Nishimura, On Packing 3-vertex Paths in a Graph

219: L. Eroh, Regular Graphs of Given Girth

116: C. Eslahchi, A.J.W. Hilton, P. D. Johnson, Progress on the Hall-Number-Two Problem

148: C. Fan, D. Lick, J. Liu,On Dominations of Product Graphs

126: R. Faudree, E. Gyori, R. Schelp, On 2-factors Containing Specified Edges

092: O. Favaron, T.W. Hayes, S.T. Hedetniemi, D.J. Knisley, Total Irredundance in Graphs

181: N. J. Finizio, A. J. Merritt, Extensions of some Z-cyclic Whist Tournaments

185: N. J. Finizio, S. J. Lewis, The Existence of Pitch Tournament Designs

093: John Frederick Fink, Wiener Polynomials of Recursively Defined Trees

052: L. R. Fischer, Almost Regular Graphs

106: S. L. Fitzpatrick, The Isometric Path Number of a Graph

057: Rex Foust, Wing Ning Li, The Complexity of two Processor Scheduling with Deadline and Communication Delay

099: M. Francel, BTD Configuration Dependencies

142: C. A. Rodger, H. L. Fu,Four-cycle Systems with Two-regular Leaves

005: Nikolaos Galatos, Serge Lawrencenko, Idzhad Kh. Sabitov, On the Construction of a Polynomial for the Volume of a Polyhedron

138: R. B. Gardner, C. Huff, J. Kennedy,Decompositions and Packings of Digraphs with Orientations of a 4-Cycle

113: W. Gasarch, E. Golub, C. Kruskal, Nonconstructive is BETTER for Sorting

137: J. C. George, The Tensor Product of Circulant Graphs need not be Circulant

205: J. P. Georges, D. W. Mauro, M. Stein, Some Results on the L(j,k)-labeling of Kn,d

212: M. Ghriga, On the Existence of Convergent Transfer Subgraphs in Labeled Directed Acyclic Graphs

067: Mark Ginn, Quasi-uniquely Edge Colorable Graphs - A Preliminary Report

032: Anant P. Godbole and Papa A. Sissokho, A Closer Look at Strict Consecutive k-out-of-n: F systems

192: R. Goldberg, J. Shapiro, I. Taksa, The Role of Ideal Sets for the Set Partitioning Problem

056: Martin Charles Golumbic, Udi Rotics, The Clique-Width of Unit Interval Graphs is Unbounded

074: Martin Charles Golumbic, Ann N. Trenk, Future Discussions: an Open Session on Tolerance Graphs

230: Niall Graham, A Celebrated Conjecture of Paul Erdos

064:Martin Greig, Finite Linear Spaces 1

047: Hans-Dietrich Gronau, Orthogonal double covers of K_n,n

048: Yuqiang Guan, Kenneth L. Williams, Profile Minimization on Triangulated Mesh Graphs

069: Yuqiang Guan, Kenneth L. Williams, How Deleting and Adding Channels to a Network Affect its Diameter

029: Heiko Harborth, Bishop and Rook Independence on Triangle Boards

151: S. Hartmann, U. Leck, V. Leck, Orthogonal Double Covers of Complete Graphs by Hamiltonian Paths

172: B. L. Hartnell, W2 Graphs with no 4-cycles

065: George Havas, Weifa Ling, Anne Street, Finding a Low-Diameter and Low-Weight k-Connected Subgraph

002: Teresa Hayes, Stephen Hedetniemi, Sandra Hedetniemi, Peter Slater, Getting a Charge out of a Graph

084: Teresa W. Haynes, James B. Phillips, Peter J. Slater, Realizability of (j,t)-Critical Graphs

088: T.W. Hayes, L.C. van der Merwe, C.M. Mynhardt, Realizability of the Criticality Index of Total Domination

105: C. C. Heckman, R. Thomas, A New Proof of the Independence Ratio of Triangle-Free Cubic Graphs

100: Michael A. Henning, Graphs with Large Least Domination Number

073: German Hernandez, On Massive Interconnection Graphs

054: Silvia Heubach, Tiling an m-by-n Area with Squares of Size up to k-by-k (m<=5)

150: S. Heuss, D. G. Hoffman, Resolvable Cycle Decomposition of Complete Multipartite Graphs

112: A.J.W. Hilton, D.S.G. Stirling, Aspects of Edge-List Colourings

129: A. M. Hinz, The Tower of Hanoi

083: T. Hishida, Constructions of Balanced Incomplete Block Designs with Nested Rows and Columns

123: Petr Hlineny, R. Thomas, On Possible Counterexamples to Negami's Planar Cover Conjecture

071: Chinh Hoang, C. McDiarmid, A Note on the Divisibility of Graphs

141: C. T. Hoang, R. Sritharan, Recognition of HH-free and HHD-free Graphs

199: R. Hochberg, Cops and Robbers on Cayley Graphs

039: D.G. Hoffman, Hamming Colorings

188: D.G. Hoffman, C. A. Parker, Complete Bipartite Graph Path Decompositions

146: D. G. Hoffman, D. A. Pike, 4-Cycle Decompositions of Km x Kn

170: P. Horak, L. Stacho, A Lower Bound on the Number of Hamiltonian Cycles

224: J. Huang, G. MacGillivray, K. L. B. Wood, Pushing the Cycles out of Multipartite Tournaments

060: Garth Isaak, Another Proof for Interval Order Representation

024: Garth Isaak, Darren Narayan, The reversing Number of a Digraph: A Disjoint Union of Paths

062: R.E. Jamison, Henry Martin Mulder, Tolerance Intersection Graphs on Subtrees of a Tree

066: Robert E. Jamison, Path Tolerance Graphs

003: Chula J. Jayawardene, Cecil C. Rousseau, Ramsey Numbers r(C₆,G) for all Graphs G of Order less than Six

086: Stanislav Jendrol, Heinz-Juergen Voss, Light Subgraphs of MultiGraphs Embedded in Compact 2-Manifolds

075: Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West, Chromatic Spectrum of Mixed Hypergraphs

161: Peter Johnson, Ken Roblee, More Extremal graphs for an Average-Triangles-Per-Edge, Maximum-Joint-Neighborhood Inequality

217: D. M. Jones, Asymptotic Results for the Genus of a Finite Field

215: C. M. Justel, L. Markenzon, Crown Graphs

208: Y. Kaneko, On an Optimal File Transfer on Path Graph with Step Arc Cost

076: John E. Karro, John L. Pfaltz, Uniform Antimatroid Closure Spaces Research

135: K. S. Kirkpatrick, Bull-Designs on Grpahs with Holes

196: S. Klasa, A. Krzyzak, On Convergence and Rates of Generalized Radial Bases Function Networks to Nonlinear Estimation and Classification

130: J. Koker, H. Moghadam, S. J. Winters, The Periphery of Edge-Deleted Graphs

040: James Korsh, Paul LaFollette, Towers, Beads, and Loopless Generation of Treess with Specified Degree Sequences

120: H-J Lai, X. Zhang, A Coloring Problem

036: Yung-Ling Lai, On the Profile of Corona of Graphs

198: P. C. B. Lam, A Sufficient Condition for a Planar Graph to be Class 1

202: P. C. B. Lam, W. C. Shiu, Edge-Magic Index Sets of (p,p)-Graphs

155: V. Leck, A Conjecture on ODC byn Paths

210: S. M. Lee, K. Schaffer, Cartesian Products of Edge-Magic and Edge-Graceful Graphs

180: V. E. Levit, E. Mandrescu, Well-Covered Trees

173: J. T. Lewis, Rectangle-free Subsets of a Square Grid

091: B. Li, J. Van Rees, Results on Lotto Designs

012: Hailan Li, Jie Wu, On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks

206: Y-H Liao, G. C. Sun, Y-N Yang, Algorithm of Edge Labeling to a Magic Graph by Factorization

108: D. D-F Liu, R. K. Yeh, On Minimum Spans of No-hole T-Colorings

140: G. MacGillivray, K. Seyffarth, Independent Domination in Planar Graphs

234: K. Mackenzie Fleming, Optimal Packing Designs

044: Lilian Markenson, Oswaldo Vernet, Characterization and Properties of Maximal Reducible Flowgraphs

209: M. Matsumoto, An Irreducibility Test of a Polynomial over a two Element Field

014: Kevin McDougal, Edge-added Eccentricities of Verticies in Graphs

031: D.R. McIntyre, F.G. Wolff, Using Canonical Trees to Efficiently Implement Huffman Decode Information

006: Alica A. McRae, Dolores A. Parks, Non-negatively Charged Graphs

190: Aaron D. Meyerowitz, Tiling Intervals with 3 Element Sets

201: Y. Miao, Balanced Nested Designs and their Applications

186: T.S. Michael, Ryser's Embedding Problem for Hadamard Matrices

079: M. Mishima, Cyclic Mendelsohn Triple Systems with a Cyclic Resolution or a Cyclic Almost Resolution

017: Nobuko Miyamoto, On Incidence Structures Between Points and Planes of of PG(3,q²)

214: H. S. Moghadam, An Order for Order Preserving Functions on a Poset

195: R. Molina, Lights Out Type Games and Variations

167: B. Montagh, A Bijection between Polygon-Dissections and certain Permutations

197: J. D. Morgan, D. A. Preece, D. H. Rees, Doubly Nested Balanced Incomplete Block Designs

026: Etsuro Moriya, Turn-Bounded Pushdown Automata Revisited

007: Amy N. Myers, Basic Interval Orders

131: B. Nagle, Turan Related Problems for Hypergraphs

089: Paul O'Donnell, A High Girth 4-Chromatic Unit Distance Graph in the Plane

121: P.R.J. Ostergard, A Fast Algorithm for the Maximum Clique Problem

175: P. Peart, W-J Woan, Bijective Proofs of the Catalan and Fine Recurrences

211: L. Petingi, J. Rodriguez, On the Conjecture that among all Graphs on n Nodes and e Edges, One with Maximum Number of Spanning Trees must be Almost-Regular

165: J. L. Pfaltz, Antimatroid Closure Spaces in a Discrete Plane

110: F. Pfender, A Result about Dense k-linked Graphs

010: Barry Piazza, Sam Stueckle, A Lower Bound for Edge-tenacity

081: Michael Raines, Ping Zhang, The Steiner Distance Dimension of Graphs

124: B. Randerath, I. Schiermeyer, Colouring Graphs with Prescribed Induced Cycle Lengths

166: A. Raychaudhuri Hamiltonian Completion Number of Interval Graphs

023: C. Renteria, H. Tapia-Recillas, Some Linear Codes of the Veronese Variety

125: R. O. Rogers, Finding Short Paths in the Rotation Graph of Binary Trees

162: A. Saito, Hamiltonian Cycles in n-factor-critical Graphs and n-extendable Graphs

109: C. D. Savage, I. Shields, Hamilton Path Heuristics and the Middle Two Levels Problem

171: L. Shapiro, The Higher You Go, the Odder it Gets

042: Jian Shen, On the Cacetta-Haggkvist Conjecture

004: Li Sheng, Cycle Free Probe Interval Graphs

058: Randy Shull, Ann N. Trenk, Polynomial Time recognition of Totally Bounded Bitolerance Digraphs

136: P. J. Slater, The Hedetniemi Number

152: P. J. Slater, E. L. Trees, Multi-Fractional Domination

164: A. Soifer, Clones in Conves Figures

183: A. G. Starling, J. B. Klerlein, An Algorithm for n-realizable Partitions of n(n+1)/2

022: Kimio Sugita, Kenji Uemura, Takeo Yaku, Induced Permutation Automata and Coverings of Strongly Connected Automata

033: Laszlo A. Szekely, Katona Type Proof for the 2-Intersecting Erdos-Ko-Rado Theorem

115: R. Thomas, J. Thomson, Excluding Minors in Nonplanar Graphs of Girth at least Five

163: L. K. Tolman, Bell Number Identities

207: L. Traldi, A Characterization of Matroids

041: Jean M. Turgeon, Equivalence Classes of Active Permutations

090: Linda Valdes, Quadrangle Cayley Graphs Embedded onthe Torus

085: Donald W. VanderJagt, Which Sequences of Iterated Jump Graphs are Planar?

037: Nathan S. Wallach, On (p,Delta) Covering Systems

063: Barrett Walls, 4-Coloring Triangle Free Graphs on N3

008: Jie Wu, On Finding a Hamiltonian Path in a Tournament Using Semi-Heap

122: R. Xu, Q. Yu Toughness and (k,r)-Factor-Critical Graphs

049: Melkamu Zeleke, On Injectivity of Discrete Radon Transform

Department of Mathematical Sciences
Florida Atlantic University
777 Glades Road
Boca Raton, Florida 33431-0991
USA

Office: Room 286, Science & Engineering
Phone: (561) 297-3350
Fax: (561) 297-2436
URL: http://www.math.fau.edu/locke/99CGTC07.htm

Last modified March 2, 1999, by S.C. Locke (with much initial typing done by F. Hoffman). How to contact me.