Full metadata record
DC FieldValueLanguage
dc.contributor.authorCOZZENS, MBen_US
dc.contributor.authorWU, SSYen_US
dc.date.accessioned2014-12-08T15:06:03Z-
dc.date.available2014-12-08T15:06:03Z-
dc.date.issued1987-10-01en_US
dc.identifier.issn0196-5212en_US
dc.identifier.urihttp://dx.doi.org/10.1137/0608054en_US
dc.identifier.urihttp://hdl.handle.net/11536/4609-
dc.language.isoen_USen_US
dc.titleON MINIMUM CRITICALLY N-EDGE-CONNECTED GRAPHSen_US
dc.typeArticleen_US
dc.identifier.doi10.1137/0608054en_US
dc.identifier.journalSIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODSen_US
dc.citation.volume8en_US
dc.citation.issue4en_US
dc.citation.spage659en_US
dc.citation.epage669en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:A1987L502200012-
dc.citation.woscount4-
Appears in Collections:Articles


Files in This Item:

  1. A1987L502200012.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.