Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Volume 113, Number 2, 15 October 2001
Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

< previous issue | next issue > | all issues

Efficient line broadcasting in a d-dimensional grid
pp. 129-141(13)
Authors: Averbuch A.; Roditty Y.; Shoham B.

Diameter determination on restricted graph families
pp. 143-166(24)
Authors: Corneil D.G.; Dragan F.F.; Habib M.; Paul C.

On completing latin squares
pp. 167-181(15)
Authors: Easton T.; Gary Parker R.

A strongly polynomial time algorithm for a constrained submodular optimization problem
pp. 183-194(12)
Author: Hartvigsen D.

On the visibility graph of convex translates
pp. 195-210(16)
Authors: Hosono K.; Meijer H.; Rappaport D.

Deterministic inverse zero-patterns
pp. 211-236(26)
Authors: Johnson C.R.; Lundquist M.; Lundy T.J.; Maybee J.S.

Bounds for isoperimetric constants of infinite plane graphs
pp. 237-241(5)
Authors: Lawrencenko S.; Plummer M.D.; Zha X.

Optimal arrangement of data in a tree directory
pp. 243-253(11)
Authors: Luczak1 M.J.; Noble S.D.

Recognition of quasi-Meyniel graphs
pp. 255-260(6)
Authors: de Figueiredo C.M.H.; Vuskovic K.

Cycle regular graphs need not be transitive
pp. 261-264(4)
Authors: Fouquet J.-L.; Hahn1 G.

A note about games-composition dimension
pp. 265-273(9)
Authors: Freixas J.; Puente M.A.

The edge versus path incidence matrix of series-parallel graphs and greedy packing
pp. 275-284(10)
Authors: Hoffman A.J.; Schieber B.

Easy cases of the D0L sequence equivalence problem
pp. 285-290(6)
Author: Honkala1 J.

On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane
pp. 291-298(8)
Author: Hosono K.

Optimal quantitative group testing on cycles and paths
pp. 299-302(4)
Authors: Hwang F.K.; Lee J.S.

Smallest independent dominating sets in Kronecker products of cycles
pp. 303-306(4)
Author: Jha1 P.K.

On the equitable chromatic number of complete n-partite graphs
pp. 307-310(4)
Authors: Lam P.C.B.; Shiu W.C.; Tong C.S.; Zhang Z.F.

A degree condition of 2-factors in bipartite graphs
pp. 311-318(8)
Authors: Li X.; Wei B.; Yang F.

Finding the k most vital edges with respect to minimum spanning trees for fixed k
pp. 319-327(9)
Author: Liang W.

Cycles of length 1 modulo 3 in graph
pp. 329-336(8)
Authors: Mei L.; Zhengguang Y.

Relative completeness with respect to two unary functions
pp. 337-342(6)
Authors: Pantovic J.; Tosic R.; Vojvodic G.

Author Index to Volume 113 (2001)
pp. 343-344(2)

< previous issue | next issue > | all issues

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A