Discrete Mathematics, Volume 135
Volume 135, Numbers 1-3, December 1994
- Horst Alzer: Refinement of an inequality of G. Bennett. 39-46
- A. Batbedat: Two representations of finite ordered sets. 47-59
- Andreas Blass: On exponentiation of G-sets. 69-79
- B. Du: On the existence of incomplete transversal designs with block size five. 81-92
- Aviezri S. Fraenkel, H. Porta, Kenneth B. Stolarsky: The almost PV behavior of some far from PV algebraic integers. 93-101
- John P. Georges, David W. Mauro, Marshall A. Whittlesey: Relating path coverings to vertex labellings with a condition at distance two. 103-111
- Frantisek Matús: Extreme convex set functions with many nonnegative differences. 177-191
- P. S. Montague: A new construction of lattices from codes over GF(3). 193-223
- Seiya Negami: Diagonal flips in triangulations of surfaces. 225-232
- Victor Neumann-Lara: The 3 and 4-dichromatic tournaments of minimum order. 233-243
- P. A. Picon: Conditions d'integrité de certains coefficients hypergéometriques: Généralisation d'un théorème de Landau. 245-263
- Frank Rhodes: Digital metrics generated by families of paths. 265-277
- Ian Robertson: T-chromatic polynomials. 279-286
- D. G. Rogers: On critical perfect systems of difference sets. 287-301
- Nabil Shalaby: The existence of near-Skolem and hooked near-Skolem sequences. 303-319
- Anders Bjært Sørensen: On the number of rational points on codimension-1 algebraic sets in Pn(Fq). 321-334
- Zsolt Tuza: Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs. 335-347
- Shaoji Xu, Jinjie Liu, Yee-Hock Peng: The chromaticity of s-bridge graphs and related graphs. 349-358
- Serge Lawrencenko, Seiya Negami, Arthur T. White: Three nonisomorphic triangulations of an orientable surface with the same complete graph. 367-369
- Kiyoshi Ando: An upper bound for orders of certain (k, k_))-connected graphs. 371-375
- Marko Razpet: On divisibility of binomial coefficients. 377-379
- Lorenzo Traldi: Generalized activities and K-terminal reliability. II. 381-385
- Keyi Xing, H. U. Baosheng: On Kotzig's conjecture for graphs with a regular path-connectedness. 387-393
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team