Each complete bipartite graph minus a matching is representable by line segments / P. van Emde Boas, T.M.V. Janssen & A. Schrijver
mainEntity
Each complete bipartite graph minus a matching is representable by line segments / P. van Emde Boas, T.M.V. Janssen & A. Schrijver
about
author
contributor
description
Voorpublicatie
inLanguage
isPartOf
mainEntityOfPage
name
Each complete bipartite graph minus a matching is representable by line segments
numberOfPages
publication
sameAs
label
Each complete bipartite graph ...... T.M.V. Janssen & A. Schrijver