Volume 254, Number 1-3, June 2002
- Elisabetta Barletta, Sorin Dragomir:
Combinatorial PDEs on Hamming graphs.
1-18
- Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-colorings.
19-32
- Thomas A. Carlson:
The edge-isoperimetric problem for discrete tori.
33-49
- Bor-Liang Chen, Kuo-Ching Huang:
On the linear k-arboricity of Kn and Kn, n.
51-61
- Carmen Cortés, Clara I. Grima, Alberto Márquez, Atsuhiro Nakamoto:
Diagonal flips in outer-triangulations on closed surfaces.
63-74
- Emeric Deutsch, Marc Noy:
Statistics on non-crossing trees.
75-87
- Guoli Ding:
On interval clutters.
89-102
- Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis:
Totally magic graphs.
103-113
- Shaun M. Fallat, Steve Kirkland, Sukanta Pati:
Minimizing algebraic connectivity over connected graphs with fixed girth.
115-142
- Shannon L. Fitzpatrick, Gary MacGillivray, Devon McCrea:
Total domination in complements of graphs containing no K4, 4.
143-151
- Ian P. Goulden, Alexander Yong:
Dyck paths and a bijection for multisets of hook numbers.
153-164
- Fumio Hazama:
On the kernels of the incidence matrices of graphs.
165-174
- Michael A. Henning:
Restricted domination in graphs.
175-189
- Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto:
On strongly identifying codes.
191-205
- Gil Kaplan, Arieh Lev, Yehuda Roditty:
Transitive large sets of disjoint decompositions and group sequencings.
207-219
- Martin Kochol:
Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property.
221-230
- Werner Kuich:
Formal series over sorted algebras.
231-258
- Jian-guo Lei:
On large sets of Kirkman systems with holes.
259-274
- Xiangwen Li, Bing Wei, Zhengguang Yu, Yongjin Zhu:
Hamilton cycles in 1-tough triangle-free graphs.
275-287
- Csaba Magyar, Ryan R. Martin:
Tripartite version of the Corrádi-Hajnal theorem.
289-308
- Bernard Mans, Francesco Pappalardi, Igor Shparlinski:
On the spectral Ádám property for circulant graphs.
309-329
- Gregory L. McColm:
MSO zero-one laws on random labelled acyclic graphs.
331-347
- Aurora Morgana, Henry Martyn Mulder:
The induced path convexity, betweenness, and svelte graphs.
349-370
- S. R. Nagpaul, S. K. Jain:
Columns of uniform color in a rectangular array with rows having cyclically repeated color patterns.
371-392
- Zhishi Pan, Xuding Zhu:
Tight relation between the circular chromatic number and the girth of series-parallel graphs.
393-404
- Nicholas Pippenger:
Galois theory for minors of finite functions.
405-419
- Philippe Pitteloud:
Log-concavity and compressed ideals in certain Macaulay posets.
421-432
- Dominique Poulalhon, Gilles Schaeffer:
Factorizations of large cycles in the symmetric group.
433-458
- Helmut Prodinger:
Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima.
459-471
- Jorge L. Ramírez Alfonsín, David Romero:
Embeddability of the combinohedron.
473-483
- Michel Rigo:
Construction of regular languages and recognizability of polynomials.
485-496
- José Plínio O. Santos:
On the combinatorics of polynomial generalizations of Rogers-Ramanujan-type identities.
497-511
- Hao Shen, Jiaying Shen:
Existence of resolvable group divisible designs with block size four I.
513-525
- Konrad J. Swanepoel:
Helly-type theorems for polygonal curves.
527-537
- Lutz Volkmann, Vadim E. Zverovich:
A disproof of Henning's conjecture on irredundance perfect graphs.
539-554
- Jianfang Wang, Haizhu Li:
The upper bound of essential cyclomatic numbers of hypergraphs.
555-564
- Xuebin Zhang:
Incomplete perfect Mendelsohn designs with block size four.
565-597
Last update Fri May 17 19:59:55 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
