Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Volume 116, Number 1, 15 January 2002
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

Almost resolvable perfect Mendelsohn designs with block size five
pp. 1-15(15)
Authors: Abel R.J.R.; Bennett1 F.E.; Ge2 G.

Measures on monotone properties of graphs
pp. 17-36(20)
Authors: Balogh J.; Bollobas B.; Weinreich D.

Uniform emulations of Cartesian-product and Cayley graphs
pp. 37-54(18)
Authors: Barth1 D.; Fragopoulou P.; Heydemann M.-C.

A constructive enumeration of nanotube caps
pp. 55-71(17)
Authors: Brinkmann G.; Nathusius U.v.; Palser A.H.R.

Optimal embeddings of odd ladders into a hypercube
pp. 73-102(30)
Authors: Caha R.; Koubek V.

Domination in distance-hereditary graphs
pp. 103-113(11)
Authors: Chang M.-S.; Wu S.-C.; Chang G.J.; Yeh H.-G.

Convexity in oriented graphs
pp. 115-126(12)
Authors: Chartrand G.; Frederick Fink1 J.; Zhang2 P.

Minimal elimination ordering for graphs of bounded degree
pp. 127-143(17)
Author: Dahlhaus E.

Augmenting trees so that every three vertices lie on a cycle
pp. 145-159(15)
Authors: Dankelmann P.; Goddard W.; Oellermann O.R.; Swart H.C.

Rearrangement of DNA fragments: a branch-and-cut algorithm
pp. 161-177(17)
Authors: Ferreira C.E.; de Souza C.C.; Wakabayashi Y.

< 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