Full metadata record
DC FieldValueLanguage
dc.contributor.author余琍琳en_US
dc.contributor.authorYu, Lie Linen_US
dc.contributor.author陳秋媛en_US
dc.contributor.authorChen, Chiuyuanen_US
dc.date.accessioned2014-12-12T02:10:59Z-
dc.date.available2014-12-12T02:10:59Z-
dc.date.issued1992en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#NT810507022en_US
dc.identifier.urihttp://hdl.handle.net/11536/57125-
dc.description.abstract在這篇論文中, 我們將考慮平面上的水平垂直線段所對應的相交圖型的辨 認問題. 我們將找出一個圖型是水平垂直線段的相交圖型的充要條件, 我 們也將列出一些不是此種相交圖型的例子. In this thesis, we shall consider the problem of characterizing the intersection graph of a family of horizontal and vertical segments in the plane which is called a "grid intersection graph". We shall give the necessary and sufficient conditions for a graph to be a grid intersection graph. We shall also list some forbidden graphs of a grid intersection graph.zh_TW
dc.language.isoen_USen_US
dc.subject圖型學; 相交圖型; 辨認zh_TW
dc.subjectGraph theory; grid intersection graphs; characterizationen_US
dc.title相交圖型的辨認問題zh_TW
dc.titleCharacterizing Grid Intersection Graphsen_US
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
Appears in Collections:Thesis