Each complete bipartite graph minus a matching is representable by line segments

Additional Metadata
Publisher	Stichting Mathematisch Centrum
Series	Stichting Mathematisch Centrum. Zuivere Wiskunde
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	van Emde Boas, P., Janssen, T.& Schrijver, L. (1976). Each complete bipartite graph minus a matching is representable by line segments. In Stichting Mathematisch Centrum. Zuivere Wiskunde (ZW 73/76). Stichting Mathematisch Centrum.

Publication