Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarThe Electronic Journal of Combinatorics, Volume 8
Volume 8, Number 1, 2001
Anthony Bonato, Wolf H. Holzmann, Hadi Kharaghani:
Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property.- Giovanni Lo Faro, Lorenzo Milazzo, Antoinette Tripodi:
On the Upper and Lower Chromatic Numbers of BSQSs(16). - Gábor N. Sárközy, Stanley M. Selkow:
On Edge Colorings with at Least q Colors in Every Subset of p Vertices. - Philippe Chassaing, Jean-François Marckert:
Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees. - Markus Fulmek, Michael Kleber:
Bijective Proofs for Schur Function Identities which Imply Dodgson's Condensation - Formula and Plu"cker Relations. - Ara Aleksanyan, Mihran Papikian:
On Coset Coverings of Solutions of Homogeneous Cubic Equations over Finite Fields. - Gaetano Quattrocchi:
Colouring 4-cycle Systems with Specified Block Colour Patterns: the Case of Embedding P3-designs. - Mikhail E. Muzychuk, Gottfried Tinhofer:
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. - Jenny Alvarez, Miguel Amadis, George Boros, Dagan Karp, Victor H. Moll, Leobardo Rosales:
An Extension of a Criterion for Unimodality. - Ralph Howard, Gyula Károlyi, László A. Székely:
Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem. - Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter:
Spanning Trees of Bounded Degree. - Ömer Egecioglu, Timothy Redmond, Charles Ryavec:
From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. - Alexander K. Kelmans, Dhruv Mubayi, Benny Sudakov:
Asymptotically Optimal Tree-Packings in Regular Graphs. - Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
General Bounds for Identifying Codes in Some Infinite Regular Graphs. - Jason Bandlow, Kendra Killpatrick:
An Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations. - Michael Plantholt, Shailesh K. Tipnis:
All Regular Multigraphs of Even Order and High Degree Are 1-factorable.
- Bruce E. Sagan, John S. Caughman IV:
The Multiplicities of a Dual-thin Q-polynomial Association Scheme. - Matthias Beck, Ira M. Gessel, Takao Komatsu:
The Polynomial Part of a Restricted Partition Function Related to the Frobenius Problem. - Chunhui Lai:
A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length.
Volume 8, Number 2, 2001
Introduction
- Doron Zeilberger:
How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic.
- Arthur T. Benjamin, Matthew Fluet, Mark L. Huber:
Optimal Token Allocations in Solitaire Knock 'm Down. - Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Computing Evolutionary Chains in Musical Sequences. - Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson:
The Subword Complexity of a Two-Parameter Family of Sequences.
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-19 21:32 CEST by the dblp team