Show simple item record

dc.rights.licenseIn Copyrighten_US
dc.creatorHardnett, Alyssa P.
dc.date.accessioned2014-06-18T18:54:08Z
dc.date.available2016-06-19T08:59:48Z
dc.date.created2014
dc.date.issued2014
dc.identifier.urihttp://hdl.handle.net/11021/28510
dc.descriptionThesis; [FULL-TEXT RESTRICTED TO WASHINGTON AND LEE UNIVERSITY LOGIN]en_US
dc.descriptionAlyssa Hardnett is a member of the Class of 2014 of Washington and Lee University.en_US
dc.description.statementofresponsibilityAlyssa Hardnett
dc.format.extent15 pagesen_US
dc.language.isoen_USen_US
dc.rightsThis material is made available for use in research, teaching, and private study, pursuant to U.S. Copyright law. The user assumes full responsibility for any use of the materials, including but not limited to, infringement of copyright and publication rights of reproduced materials. Any materials used should be fully credited with the source.en_US
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en_US
dc.subject.otherWashington and Lee University -- Honors in Mathematicsen_US
dc.titleRealizablity of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis)en_US
dc.typeTexten_US
dc.rights.holderHardnett, Alyssa P.
dc.subject.fastGraph theoryen_US
dc.subject.fastGraph connectivityen_US
local.embargo.terms2 yearsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record