Invited talks

Monday, March 3, 2003

TBA, TBA (9:30)

Tuesday, March 4, 2003

Joan Hutchinson, Extending Precolorings of Graphs , 9:30 AM

Joan Hutchinson, On Visibility Graphs , 2:00 PM

Wednesday, March 5, 2003

Richard Brualdi, My Favorite Classes of Matrices: Some Recent Developments , 10:30 AM

Alfred Menezes, Curves and Cryptography 2:00 PM

Thursday, March 6, 2003

Alfred Menezes, Curves and Cryptography 9:30 AM

Friday, March 7, 2003

Spyros Magliveras, Something Euler Would Have Liked , 9:20 AM

Search

Click here for Advanced Search

Contributed talks

001: Zhongyuan Che, Karen Collins Retracts of Cartesian Products of (2k+1)-angulated graphs and Construction of Cores, Mon 10:40 AM

002: Larry Cummings, Divisibility Exponents and thw Zimin Recursion, Mon 10:40 AM

003: Catherine Baker, Skolem Labelling of Generalized Windmills, Mon 10:40 AM

004: , Mon 10:40 AM

005: Ward Heilman, The Twised Torus, the Tangled Torus and Toughness, Mon 11:00 AM

006: H. Tapia-Recillas, Some binary bent functions arising from bent functons over, Mon 11:00 AM

007: Dinonysios Kountains, Satyapurnadevi Padala, Weighted Steiner tre on the rectilinear space , Mon 11:00 AM

008: Leroy B. Beasley, Properties of 2-Primitive Tourament Diagraphs, Mon 11:00 AM

009: G. Chappell, J. Gimbel, C. Hartman Bounds on the Metric and PArttion Dimension of a Graph, Mon 11:20 AM

010: L. Van Wormer, A. Zeleke, On α-Type Matrices, Mon 11:20 AM

011: D. Kountanis, S.P. Durairaja, Reducing Congestion Probability Using Deviation Index as a Metric, Mon 11:20 AM

012: R. Laue, A Database of Visualizations of Graphs, Mon 11:20 AM

013: D.G. Hoffman, S.H. Holliday, On Resolvable Decompositions of Complete Multipartite Graphs Minus a One-Factor into Uniform Cycles, Mon 11:40 AM

014: D. Schwegler, A. Zeleke, On Roots of Generalized Fibonacci Polynomials, Mon 11:40 AM

015: D. Kountanis, K. Kokkinos, Load Balancing and Congestion Avoidance Routing, Mon 11:40 AM

016: F. Lutscher, J. McNulty, J. Morris, K. Seyffarth, Stitching Images Back Together, Mon 11:40 AM

017: M. Albertson, Smith. C, G. Chappell, H.A. Kierstead, A. Kundgen, R. Ramamurthi, Coloring with no 2-colored p4's , Mon 2:00 PM

018: D.J. Ashe, H.L. Fu, C.A. Rodger, All 2-Regular Leaves of Partial 6-Cycle Systems , Mon 2:00 PM

019: G. Jain, C. Purdy, The Analysis of Experiments on Heuristics Algorithms Improving the State of the Art , Mon 2:00 PM

020: J. Ellis-Monaghan, P. Gutwin, Graph theoretical problems in next generation chip design , Mon 2:00 PM

021: M. Tkac, H.-J. Voss, On k-trestles in chordal polyhedral graphs , Mon 2:20 PM

022: R. Anstee, A. Sali, Small Forbidden Configurations , Mon 2:20 PM

023: O. Favaron, G.H. Fricke, D. Skaggs, S.M. Hedetniemi, S.T. Hedetniemi, R.C. Laskar, R. Kristiansen, Offensive Alliances in Graphs , Mon 2:20 PM

024: Y. Chen, E. Cheng, S. Kruk, Routing in Unidirectional Alternating Group Graphs and Split-Stars , Mon 2:20 PM

025: M. Pelsmajer, D. West, A short proof of a characterization of strongly chordal graphs, Mon 2:40 PM

026: S. Costa, N. Finizio, B. Travers, (t,12) GWhD(12n+1) - Existence Results for t=2,3,4 , Mon 2:40 PM

027: E. Cheng, S. Kruk, M. Lipman, Approximation Algorithms for the Student Scheduling Problem , Mon 2:40 PM

028 N. Deo, Z. Nikoloski, Cops-and Robbers on Cyber Graphs , Mon 2:40 PM

029: T. Whalen, Ore conditions, Path-Systems, and Linkages in Graphs , Mon 3:20 PM

030: M. Klin, S. Reichard, On Partial Linear Spaces with a pseudo-geometric GQ(s+1,s-1) point Graph , Mon 3:20 PM

031: W. Edelson, M. Gargano, P. Meisinger, P. Benjamin, Evolving Efficient Security Systems Under Budget Constraints Using Genetic Algorithms , Mon 3:20 PM

032: M. Bartha, Deciding the deterministic property of soliton graphs in linear time , Mon 3:20 PM

033: R. Eggleton, H. Calkins, Congruent decompositions of complete graphs , Mon 3:40 PM

034: H. Uehara, Metering Schemes Based on Polynomials over Finite Fields , Mon 3:40 PM

035: J. DeCicco, M. Gargano, W. Edelson, Analysis of the Sensitivity of a Time Dependent Minimal Node Base Directed Communication , Mon 3:40 PM

036: W. Goddard, S.M. Hedetniemi, S.T. Hedetniemi and R. Laskar, Generalized Matchings in Graphs , Mon 3:40 PM

037: , Mon 4:00 PM

038: Y. Mutoh, An asymptotic existence theorem of a BIB design with nested rows and columns , Mon 4:00 PM

039: A. Farrugia, Vertex-partitioning into additive induced-hereditary properties is NP-hard , Mon 4:00 PM

040: J. Bagga, R. Balakrishnan, R. Sampathkumar, N. Thillaigovindan, Some Properties of Triangle Graphs , Mon 4:00 PM

041: , Mon 4:20 PM

042: K. Ozawa, Construction for BIBRC not having completely balanced property , Mon 4:20 PM

043: A. C. Lee, On an application of graph theory in formal learning theory , Mon 4:20 PM

044: S. J. Winters, Cycle Decomposition Numbers of Graphs , Mon 4:20 PM

045: , Mon 4:40 PM

046: H. Lefmann, Sparse Parity Check Matrices over Finite Fields , Mon 4:40 PM

047: M.L. Gargano, L.V. Quintas, Complementary Arithmetic Sequences , Mon 4:40 PM

048: H. Liu Discrete Isoperimetric Inequalities: a survey , Mon 4:40 PM

049: , Mon 5:00 AM

050: M. Greig, Designs from Discrete Log Tables , Mon 5:00 AM

051: E. Cheng, J.W. Grossman, M.J. Lipman, Influence Digraphs Induced by Time-Stamped Graphs , Mon 5:00 AM

052: Mon 5:00 PM

053: John J. Watkins, A Miscellany of Chessboard Problems ,Tue 8:40 AM

054: K. J. Roblee, T. D. Smotzer, Some Extremal Subfamilies of some Extremal Families of Nearly Strongly Regular Graphs ,Tue 8:40 AM

055: John L. Pfalz, Discrete Antimatroid Topology , Tue 8:40 AM

056: B. Montagh Some Anti-Ramsey numbers of large double stars , Tue 8:40 AM

057: H. Harborth, Independence on Triangular Hexagon Boards, Tue 9:00 AM

058: A. Kelmans, On Packing Subgraphs in a Graph , Wed 4:40 PM

059: M. Edmonds, J. McNulty, The Fractional Flow Number of Rank 3 Orientable Matroids , Tue 9:00 AM

060: S. Shelah, A. Soifer, Axiom of Choice and Chromatic Number of the Plane , Tue 9:00 AM

061: K. Bogart, Teaching Introductory Combinatorics by Guided Discovery , Tue 10:50 AM

062: M. Gilpin,{The orders of GL(k,Zn) and SL (k, Zn) , Tue 10:50 AM

063: W. Gu, X. Jia, J. Shen, On Perfect Independent Dominating Sets of Graphs , Tue 10:50 AM

064: M. Dufour, J. M.Turgeon, Two theorems pertaining to the coloring of the edges of a graph , Tue 10:50 AM

065: R. E. Jamison, N. Lochner, Tiling Fringed Chessboards with Dominoes , Tue 11:10 AM

066: G. Ralucca, P. Zhang, V. Saenpholphat, Divisor Graphs , Tue 11:10 AM

067: L. Langley, S. Merz, The Number of Minimum alpha-Dominating Sets in Tournaments , Tue 11:10 AM

068: V. Voloshin, Coloring Mixed Hypergraphs: theory, algorithms and applications , Tue 11:10 AM

069: I. Anderson, D. A. Preece, Some Narcissistic Half-and-Half Power-Sequence Z_p Terraces with Segments of Different Lengths , Tue 11:30 AM

070: G. Exoo Cages and Voltage Graphs , Tue 11:30 AM

071: S. Merz, D. Stewart, Gallai-type Theorems and Domination Parameters in Digraphs , Tue 11:30 AM

072: R.D.Morris, Upper bounds for Erdős-Rado numbers , Tue 11:30 AM

073: H. Martini, Generalized convexity notions and combinatorial geometry , Tue 11:50 AM

074: K. Ferland, L. Doty, Nearly Cubic Maximally Tough Graphs, Tue 11:50 AM

075: J.D. Factor, Partial Domination Graphs of Extended Regular Tournaments: Chords and Cycles , Tue 11:50 AM

076: G. Chartrand, P. Zhang, E. Salehi, Local Colorings of Graphs , Tue 11:50 AM

077: , Tue 12:10 PM

078: D. Erwin, F. Harary, Destroying automorphisms by fixing points , Tue 12:10 PM

079: , Tue 12:10 PM

080: W. Goddard, S. Hedetniemi, S. Hedetniemi, J. Harris, D. Rall, Broadcast Chromatic Numbers of Graphs , Tue 12:10 PM

081: , Tue 3:20 PM

082: D.E. Brown, J. Richard Lundgren, Some Characterizations of Unit Interval Bigraphs , Tue 3:20 PM

083: T. Burton, M. Matthews, I-Spy and Domination Critical Graphs: A Preliminary Report , Tue 3:20 PM

084: E. Gethner, W.M. Springer II, How False is Kempe's Proof of the Four Color Theorem? , Tue 3:20 PM

085: , Tue 3:40 PM

086: D.E. Brown, J. Richard Lundgren, Relationships among varieties of interval graphs, probe interval graphs, and (0,1)-matrices , Tue 3:40 PM

087: T. Burton, M.elissa Matthews, Dot Critical - The hazards of }$i$\textbf{: A Preliminary Report , Tue 3:40 PM

088: M. Plantholt, A Combined Logarithmic Bound on the Chromatic Index of Multigraphs , Tue 3:40 PM

089: , Tue 4:00 PM

090: L. Eroh, J. Koker, K. McDougal, H. Moghadam, S. Winters, Average Edge-Deleted Eccentricity , Tue 4:00 PM

091: D. Stewart, Quadrangular Tournaments and Orthogonal Matrices , Tue 4:00 PM

092: V. Kostyuk, D.A. Narayan, V.A. Shults, Color Distribution in Minimal k-Rankings , Tue 4:00 PM

093: , Tue 4:20 PM

094: D.R. Berman, D.D. Smith, Towards Minimal-Violations Rankings for Whist Tournaments , Tue 4:20 PM

095: S.R. Kingan, On Matroid Generation , Tue 4:20 PM

096: V. Kostyuk, D.A. Narayan, V.A. Shults, Minimal k-Rankings and the A-rank Number of a Path , Tue 4:20 PM

097: , Tue 4:40 PM

098: B.J. Latka, No Maximal Antichain of Tournaments With 3 Elements , Tue 4:40 PM

099: N.B. McMurray, Jr., On largest Circuits and Cocircuits in Matroids , Tue 4:40 PM

100: G. Bullington, L. Eroh, J. Koker, K. McDougal, H.Moghadam, S. Winters, S. Stalder, Forbidden Subgraph Edge Colorings, Tue 4:40 PM

101: , Tue 5:00 PM

102: R. Hochberg, M.F.M. Stallmann, Linear Arrangement of Trees , Tue 5:00 PM

103: , Tue 5:00 PM

104: , Tue 5:00 PM

105: S.Y. Alsardary, An Upper Bound on the Basis Number of the Powers of the Complete Graphs , Wed 8:40 AM

106: O. Heden, On the faces problem for perfect codes , Wed 8:40 AM

107: H. Balakrishnan, N. Deo, Radiocolorings of Graphs and their Complements, Wed 8:40 AM

108: R. Haas, D. Orden, F. Santos, G. Rote, B. Servatius, H. Servatius, D. Souvaine, I. Streinu, W. Whiteley, Planar Minimally Rigid Graphs and Pseudo-Triangulations , Wed 8:40 AM

109: G.J. Davis, G.S. Domke, C.R. Garner, Jr., Ranks of Graph Complements , Wed 9:00 AM

110: V. Yorgov, New Optimal Self-Dual Codes of Length 106 , Wed 9:00 AM

111: K.H. Shafique, R.D. Dutton, Maximum Alliance-Free and Minimum Alliance-Cover Sets , Wed 9:00 AM

112: G. Chartrand, P. Zhang, J.F. Fink, The Hull Number of an Oriented Graph , Wed 9:00 AM

113: M.R. DeDeo, Generalized Kloosterman sums over rings of order 2r and their Association to Graphs , Wed 9:20 AM

114: S. Heubach, R. Grimaldi, Binary Strings Without Odd Runs of Zeros , Wed 9:20 AM

115: N. Deo, P. Micikevicius, One-factorization-based collective communication on a cluster of workstations , Wed 9:20 AM

116: B. McKay, A. Meynert, W. Myrvold, Counting Small Latin Squares , Wed 9:20 AM

117: M. Ferrara, Y. Kohayakawa, V. Rodl, Spacing Numbers of Graphs , Wed 9:40 AM

118: P. Chinn, S. Heubach, Compositions with no occurrence of a particular number , Wed 9:40 AM

119: Y. Zhang, N. Deo,Computing the diameter of random connected graph , Wed 9:40 AM

120: R. Bean, I. Wanless, Subsquare-rich Latin squares and their critical sets, Wed 9:40 AM

121: C.L. Cocking, K.A.S. Factor, Domination Graphs of Symmetric Digraphs I: Stable Forms of Complete Biorientations of Disconnected, Complete, Bipartite, and Tripartite Graphs , Wed 3:20 PM

122: J. Ganci, D.B. West, The smallest k-regular h-edge-connected graphs without 1-factors , Wed 3:20 PM

123: P. Gupta, N. Deo, Expected Value of the Diameter of a Random Graph and its Implications for the Web Graph , Wed 3:20 PM

124: E.S. Yazici, The metamorphosis of 2-fold 4-cycle systems into 2-fold 6-cycle systems , Wed 3:20 PM

125: K.A.S. Factor, Domination graphs of symmetric digraphs II: unipathic digraphs as biorientations of trees , Wed 3:40 PM

126: G.E. Stevens, R.E. Jamison, Isomorphic Factorizations of Some Linearly Recursive Trees , Wed 3:40 PM

127: H. Harutyunyan, B. Shao, k-broadcast Time of Tree Networks , Wed 3:40 PM

128: D.G. Hoffman, C.C. Linder, Two-fold Maximum Packing C3 to C4 Metamorphoses , Wed 3:40 PM

129: P.D. Johnson, R.R. Rubalcaba, M.P. Walsh, Fractional Domination and Packing in Graphs , Wed 4:00 PM

130: G. Isaak, Large Hamiltonicity of digraphs for universal cycles of permutations , Wed 4:00 PM

131: J.C. Wierman, D. Naor, Desirable Properties of Universal Formulas for Percolation Thresholds , Wed 4:00 PM

132: M.J. Grannell, T.S. Griggs, R.G. Stanton, Title Coverings of type g-super-4 for lambda = 3 or 4 , Wed 4:00 PM

133: P. Xiang, J. Wierman, Limit Theory of the Domination Number for the Class Cover Catch Diagraphs , Wed 4:20 PM

134: S-M Lee, A.N-T Lee, On Super Edge-magic Graphs with Many Odd Cycles , Wed 4:20 PM

135: W.D. May, J.C. Wierman, Improved methods for computing rigorous bounds on percolation thresholds , Wed 4:20 PM

136: E.J. Billington, Metamorphosis of lambda-fold designs with block size four into 3-stars: the final case , Wed 4:20 PM

137: R. Laskar, A. McRae, C. Wallis, Domination in Triangulated Chessboard Graphs , Wed 4:40 PM

138: D. Boutin, Convex geometric graphs with no short self-intersecting paths , Wed 4:40 PM

139: , Wed 4:40 PM

140: B.P.C. Li, Constructing Resolvable (n,3,3,2) Lotto Designs Using Resolvable Covering Designs and Kirkman Triple Systems , Wed 4:40 PM

141: M. Anderson, J. Yellen, R. Brigham, Two classes of extremal graphs, Wed 5:00 PM

142: S.E. Shauger, B. Zheng, Algorithmic advances in finding (a mod 5)-cycles in graphs , Wed 5:00 PM

143: , Wed 5:00 PM

144: L.T. Pebody, Combinatorial Reconstruction using Polynomial Invariants , Wed 5:00 PM

145: X. Xiaodong, X. Zheng, S.P. Radziszowski A Constructive Approach for the Lower Bounds on the Ramsey Numbers R(s,t) , Thur 8:40 AM

146: A. Kemnitz, [r,s,t]-Colorings of Graphs , Thur 8:40 AM

147: A. McRae, D. Parks, K. Wise, Coloring paired graphs , Thur 8:40 AM

148: W-J Woan, Bijections of Combinatorial Objects , Thur 8:40 AM

149: P. Blanchard, On Pseudo-Arithmetic Ramsey Numbers , Thur 9:00 AM

150: L. Dunning, Yet Another Algorithm for Generating the Gray Code , Thur 9:00 AM

151: M. Cropper, P. Johnson, More on Hall t-chromatic graphs , Thur 9:00 AM

152: R.P. Grimaldi, Binary Strings with No Isolated 1's in Even Positions , Thur 9:00 AM

153: O. Pikhurko, Size Ramsey numbers and linear programming , Thur 11:10 AM

154: P-T Chung,Combinatorial Algorithms for Computing Aggregate Functions in Probabilistic Relational Databases , Thur 11:10 AM

155: M.M. Cropper, A.J.W. Hilton, P.D. Johnson Jr., k-fold coloring even cycles with Hall's condition , Thur 11:10 AM

156: C. Moore, A Simple Generating Function for some Generalized Random Walk , Thur 11:10 AM

157: V. Grolmusz, From Ramsey-Graphs to Fast Matrix Multiplication , Thur 11:30 AM

158: Y. Peng, C. Zhao, On incomparable and uncomplemented families of sets , Thur 11:30 AM

159: I. Broere, S.Dorfling, E. Jonck,Generalized Chromatic Numbers and Additive Hereditary Properties of Graphs , Thur 11:30 AM

160: K. Humphreys, H. Niederhausen, Counting Infinite Step Set Lattice Paths using Umbral Calculus , Thur 11:30 AM

161: J-P. Bode, Mosaic Graph Ramsey Numbers , Thur 11:50 AM

162: L. Kazmierczak, F. Boesch, C. Suffel, D. Gross, Forbidden subgraph conditions on the complements of a graph that insure a strong network design , Thur 11:50 AM

163: , Thur 11:50 AM

164: S. Getu, Lattice Paths on Parallel Planes , Thur 11:50 AM

165: A. Hubenko, J. Solymosi, A. Gyárfás, Large cliques in C_4-free graphs , Thur 12:10 PM

166: N. Kahl, Reliability, T-Optimal Graphs, and the Multigraph Conjecture , Thur 12:10 PM

167: , Thur 12:10 PM

168: D. Hough and Louis Shapiro, Lattice Polynomials , Thur 12:10 PM

169: E.J. Cockayne, S. Finbow, Generalised Irredundance in Graphs: Nordhaus-Gaddum Bounds , Thur 2:00 PM

170: G. Bachman, E. Salehi, Nonmagic and K-nonmagic Graphs , Thur 2:00 PM

171: M. Walsh, Competition chromatic numbers of graphs , Thur 2:00 PM

172: D. Hough, L. Shapiro, Noncrossing Trees , Thur 2:00 PM

173: G. Chartrand, T. Thomas, P. Zhang, V. Saenpholphat, A New Look at Hamiltonian Walks I , Thur 2:20 PM

174: T.A. Redl,Graceful Graphs and Graceful Labelings: Two Mathematical Programming Formulations and Some Other New Results , Thur 2:20 PM

175: S. Krause, Ramsey Numbers for Circulant Colorings , Thur 2:20 PM

176: M. Jani, M. Zeleke, k-Trees, Catalan Identities and Applications - Part I , Thur 2:20 PM

177: G. Chartrand, T. Thomas, P. Zhang, V. Saenpholphat, A New Look at Hamiltonian Walks II , Thur 2:40 PM

178: B. Hartnell, D. Rall, Edge Labeling and Deletion Games , Thur 2:40 PM

179: I. Schiermeyer,Large Rainbow Colourings , Thur 2:40 PM

180: M. Jani, M. Zeleke,k-Trees, Catalan Identities and Applications - Part II , Thur 2:40 PM

181: A.G. Starling, J. Kier, J.B. Klerlein, Generating Cycles in the Digraph P(n,k): An Algorithm , Thur 3:20 PM

182: S-M Lee, L. Wang, Y. Wen, On The Edge-magic Cubic Graphs and Multigraphs , Thur 3:20 PM

183: R.E. Jamison, On Extremal Rankings of Graphs , Thur 3:20 PM

184: A. Nkwanta, Two more Fibonacci walks , Thur 3:20 PM

185: D.A. Pike, On a Conjecture of Bermond , Thur 3:40 PM

186: S-M Lee, Y-C Wang, On Super Edge-magicness of Chain Graphs whose Blocks are Complete Graphs , Thur 3:40 PM

187: S-J Kim, A. Kostochka, K. Nakprasit, On the chromatic number of intersection graphs of convex sets in the plane , Thur 3:40 PM

188 H. Niederhausen, An Algebraic Approach to Counting Random Walks in Quadrants and Octants , Thur 3:40 PM

189: K.T. Balinska, M.L. Gargano, L.V. Quintas, Hamilton Paths in Graphs Whose Vertices are Graphs , Thur 4:00 PM

190: , Thur 4:00 PM

191: G. Agnarsson, A. Egilsson, On Vertex Coloring Simple Genetic Digraphs , Thur 4:00 PM

192: L.S. Matthews, Enumeration of Disjoint Motzkin Path Systems , Thur 4:00 PM

193: S. Curran, Enumeration of Hamilton Paths in Cayley Digraphs , Thur 4:20 PM

194: , Thur 4:20 PM

195: D.G. Hoffman, S.A. Clark, Edge-Color Balance in K_n , Thur 4:20 PM

196: J. Fukuyama, On the Topology of The Hamming Distance between Set Systems , Thur 4:20 PM

197: , Thur 4:40 PM

198: , Thur 4:40 PM

199: E. Duea, K. Overbay, C. Parks, J. Rhyne, Grundy Coloring of Chessboard Graphs , Thur 4:40 PM

200: B. Tankersley, The Determinant Sequence of Hankel Matrices , Thur 4:40 PM

201: ,

202: ,

203: ,

204: ,

205: ,

206: ,

207: ,

208: ,

209: ,

210: ,

211: ,

212: ,

213: , Fri 10:50 AM

214: E. Gottlieb, A Lexicographical Shelling for a New Lattice of Partitions , Fri 10:50 AM

215: D.V. Chopra, Further Contributions to Balanced Arrays , Fri 10:50 AM

216: V.E. Levit, E. Mandrescu, A Family of Well-Covered Graphs with Unimodal Independence Polynomials , Fri 10:50 AM

217: , Fri 11:10 AM

218: K. Qiu, Interesting Sequences in Star Graphs , Fri 11:10 AM

219: M. Raines, Extended 5-Cycle Systems having a Prescribed Number of Idempotent Elements , Fri 11:10 AM

220: T-M Wang, On line graphs with a unique set of cliques which covers all edges , Fri 11:10 AM

221: , Fri 11:30 AM

222: J. Bagga, J. Emert, J.M. McGrew, Visibility Graphs on the Sphere , Fri 11:30 AM

223: H. Era, S. Iwai, K. Ogawa, M. Tsuchiya, A note on Hereditary Double Bound Graphs , Fri 11:30 AM

224: R. Barbosa, D.M. Cardoso, On a subclass of well-covered graphs , Fri 11:30 AM

225: , Fri 11:50 AM

226: A.M. Dean, N. Veytsel, Unit Bar-visibility Graphs , Fri 11:50 AM

227: E. DeLa Vina, B. Waller, Independence, Radius and Path Coverings in Trees , Fri 11:50 AM

228: E.L.C. King, Characterizing a Subclass of Well-Covered Graphs , Fri 11:50 AM

229: , Fri 12:10 PM

230: Moghadam, Eroh, Koker, Winters, Classifying Trees with Edge Deleted Central Appendage Number 2 , Fri 12:10 PM

231: B.A. Pyle, Abdiff-tolerance edge clique cover numbers , Fri 12:10 PM

232: P. Luo, Y. Peng, C. Zhao, A generalized graph partitioning problem , Fri 12:10 PM

Top

Last modified February 27, 2003. Please send your comments to meyerowi@fau.edu