<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

ON MINIMUM CRITICALLY N-EDGE-CONNECTED GRAPHS

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

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
A1987L502200012.pdf
Size:
1 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: