Volume 296, Number 1, June 2005
Contributions
- Riccardo Biagioli, Frédéric Chapoton:
Supersolvable LL-lattices of binary trees.
1-13

- Betsy Crull, Tammy Cundiff, Paul Feltman, Glenn H. Hurlbert, Lara Pudwell, Zsuzsanna Szaniszló, Zsolt Tuza:
The cover pebbling number of graphs.
15-23

- Martin Charles Golumbic, Haim Kaplan, Elad Verbin:
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems.
25-41

- Zoran Radosavljevic, Marija Rasajski:
Multicyclic treelike reflexive graphs.
43-57

- Ngo Dac Tan, Le Xuan Hung:
On the Burkard-Hammer condition for hamiltonian split graphs.
59-72

- Tongsuo Wu:
On directed zero-divisor graphs of finite rings.
73-86

- Xuebin Zhang:
Compatibly ordered-OSTS of order n and compatibly ordered-OGDD of type hn for n=6k+1.
87-102

- Igor E. Zverovich:
A finiteness theorem for primal extensions.
103-116

Notes
Volume 296, Number 2-3, July 2005
Contributions
- Giovanna Bonoli, Olga Polverino:
The twisted cubic in PG(3, q) and translation spreads in H(q).
129-142

- Dumitru Busneag, Florentina Chirtes:
LMn-algebra of fractions and maximal LMn-algebra of fractions.
143-165

- Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho:
Edge-disjoint spanners in Cartesian products of graphs.
167-186

- Yuan Hong, Xiao-Dong Zhang:
Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees.
187-197

- A. Kyriakoussis, Malvina Vamvakari:
Generalization of matching extensions in graphs-combinatorial interpretation of orthogonal and q-orthogonal polynomials.
199-209

- Zhaoxiang Li, Yanpei Liu:
Chromatic sums of 2-edge-connected maps on the plane.
211-223

- Haruhide Matsuda:
On 2-edge-connected [a, b]-factors of graphs with Ore-type condition.
225-234

- Miri Priesler, Michael Tarsi:
Multigraph decomposition into stars and into multistars.
235-244

- Christian M. Reidys:
On certain morphisms of sequential dynamical systems.
245-257

Notes
Last update Sat May 18 20:21:52 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page