Show simple item record

dc.contributor.authorBarat, J
dc.contributor.authorMatousek, J
dc.contributor.authorWood, D
dc.date.available2014-05-21T22:43:24Z
dc.date.issued2006
dc.identifierR3
dc.identifier.citationBarat, J., Matousek, J. & Wood, D. (2006). Bounded-degree graphs have arbitrarily large geometric thickness. Electronic Journal of Combinatorics, 13 (1)
dc.identifier.urihttp://hdl.handle.net/11343/29215
dc.subjectPure Mathematics
dc.titleBounded-degree graphs have arbitrarily large geometric thickness
dc.typeJournal Article
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentMathematics and Statistics
melbourne.source.titleThe Electronic Journal of Combinatorics
melbourne.source.volume13
melbourne.source.issue1
melbourne.publicationid137685
melbourne.elementsid318227
melbourne.contributor.authorWOOD, DAVID
dc.identifier.eissn1077-8926
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record