Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/34430
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNipa Jun-Onen_US
dc.date.accessioned2014-09-19T04:48:01Z-
dc.date.available2014-09-19T04:48:01Z-
dc.date.issued2007en_US
dc.identifier.govdocTh 512.7 N719Men_US
dc.identifier.urihttp://search.lib.cmu.ac.th/search/?searchtype=.&searcharg=b1436317en_US
dc.identifier.urihttp://cmuir.cmu.ac.th/handle/6653943832/34430-
dc.language.isoengen_US
dc.publisherChiang Mai : Graduate School, Chiang Mai University, 2007en_US
dc.subjectBipartite graphsen_US
dc.subjectMathematicsen_US
dc.titleMaximal (1,N)-matching number of bipartite graph = จำนวนการจับคู่ใหญ่สุดเฉพาะกลุ่ม (1,n) ของกราฟสองส่วน / Nipa Jun-Onen_US
dc.typeThesisen_US
Appears in Collections:SCIENCE: Theses



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