Hartel, P. H. (1988) The average size of ordered binary subgraphs. van Leeuwen, J. (ed.) Graph-theoretic concepts in computer science, WG 88, LNCS 344. pp. 327-351 .
Record type:
Conference or Workshop Item
(Other)
This record has no associated files available for download.
More information
Published date: June 1988
Additional Information:
Address: Amsterdam, The Netherlands
Venue - Dates:
Graph-theoretic concepts in computer science, WG 88, LNCS 344, 1988-05-31
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 253130
URI: http://eprints.soton.ac.uk/id/eprint/253130
PURE UUID: d819d171-4021-4f69-b27e-18a02520a385
Catalogue record
Date deposited: 03 May 2000
Last modified: 10 Dec 2021 20:31
Export record
Contributors
Author:
P. H. Hartel
Editor:
J. van Leeuwen
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.