Volume 285,
Number 1-3,
August 2004
- Vladimir E. Alekseev, Dmitry V. Korobitsyn, Vadim V. Lozin:
Boundary classes of graphs for the dominating set problem.
1-6
- Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov:
Tight bounds on maximal and maximum matchings.
7-15
- Béla Bollobás, Vladimir Nikiforov:
Hermitian matrices and graphs: singular values and discrepancy.
17-32
- Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski:
The k-fractal of a simplicial complex.
33-45
- Xiang En Chen:
On the largest eigenvalues of trees.
47-55
- Kinkar Chandra Das:
Maximizing the sum of the squares of the degrees of a graph.
57-66
- Tomislav Doslic, Dragutin Svrtan, Darko Veljan:
Enumerative aspects of secondary structures.
67-82
- Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro:
Spanning spiders and light-splitting switches.
83-95
- Gennian Ge, Alan C. H. Ling:
Group divisible designs with block size four and group type gum1 for small g.
97-120
- Mike J. Grannell, Vladimir P. Korzhik:
Nonorientable biembeddings of Steiner triple systems.
121-126
- Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori, Yukio Shibata:
On the number of cycles in generalized Kautz digraphs.
127-140
- Fred B. Holt:
Blending simple polytopes at faces.
141-150
- Max I. Kanovich:
Finding direct partition bijections by two-directional rewriting techniques.
151-166
- Manoel Lemos:
Elements belonging to triads in 3-connected matroids.
167-181
- Mirko Lepovic:
On integral graphs which belong to the class alphaKa cup betaKb, b.
183-190
- Dan Levy:
Injectivity and surjectivity of Collatz functions.
191-199
- Eunice Gogo Mphako:
H-lifts of tangential k-blocks.
201-210
- Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota:
Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces.
211-218
- M. I. Ostrovskii:
Minimal congestion trees.
219-226
- Christian Peters, Lutz Volkmann:
Vertex 6-pancyclic in-tournaments.
227-238
- Norbert Polat:
Fixed finite subgraph theorems in infinite weakly modular graphs.
239-256
- Matej Stehlík:
A generalisation of matching and colouring.
257-265
- Lutz Volkmann, Stefan Winzen:
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc.
267-278
- Liming Xiong, Hajo Broersma, Xueliang Li, MingChu Li:
The hamiltonian index of a graph and its branch-bonds.
279-288
- Paul Thomas Young:
Degenerate and n-adic versions of Kummer's congruences for values of Bernoulli polynomials.
289-296
- Robert E. L. Aldred, Carsten Thomassen:
Graphs with not all possible path-kernels.
297-300
- Abraham Flaxman:
A sharp threshold for a random constraint satisfaction problem.
301-305
- Tatsuya Fujisaki:
A construction of amorphous association scheme from a pseudo-cyclic association scheme.
307-311
- Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments.
313-318
- Pavol Hell, Juan José Montellano-Ballesteros:
Polychromatic cliques.
319-322
- Marcel Herzog, Gil Kaplan, Arieh Lev:
Representation of permutations as products of two cycles.
323-327
- Juha Honkala, Michel Rigo:
Decidability questions related to abstract numeration systems.
329-333
- Daphne Der-Fen Liu:
Circular chromatic number for iterated Mycielski graphs.
335-340
- Haicheng Ma, Haizhen Ren:
sigma-polynomials.
341-344
- Nicolas Sendrier:
Linear codes with complementary duals meet the Gilbert-Varshamov bound.
345-347
- John M. Talbot:
A new Bollobás-type inequality and applications to t-intersecting families of sets.
349-353
- Ioan Tomescu:
Sunflower hypergraphs are chromatically unique.
355-357
- Lutz Volkmann:
Hamiltonian paths containing a given arc, in almost regular bipartite tournaments.
359-364
Last update Wed Feb 15 05:30:50 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
