Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01dn39x364x
Title: The Max Flow Min Cut Property in T-join Hypergraphs of Planar Graphs
Authors: Mihaescu, Radu
Advisors: Seymour, Paul
Department: Mathematics
Class Year: 2003
Extent: 38 Pages
Other Identifiers: 16301
URI: http://arks.princeton.edu/ark:/88435/dsp01dn39x364x
Location : This thesis can be viewed in person at the Mudd Manuscript Library. To order a copy complete the Senior Thesis Request Form. For more information contact mudd@princeton.edu.
Type of Material: Princeton University Senior Theses
Appears in Collections:Mathematics, 1934-2016

Files in This Item:
There are no files associated with this item.


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.