Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/49463
題名: 最大,二分,外平面圖之容忍表示法
The Tolerance Representations of Maximal Bipartite Outerplanar Graphs
作者: 賴昱儒
貢獻者: 張宜武
賴昱儒
關鍵詞: 最大外平面圖
二分圖
容忍表示法
Tolerance Graphs
Maximal Outerplanar Graphs
Bipartite
日期: 2009
上傳時間: 8-Dec-2010
摘要: 在這篇論文中,我們針對2-連通的最大外平面圖而且是二分圖的圖形,討論\n其容忍表示法,並找到它的所有禁止子圖H1、H2、H3、H4。
In this thesis, we prove a 2-connected graph G which is maximal outerplanar and bipartite is a tolerance graph if and only if there is no induced subgraphs H1; H2; H3 and H4 of G.
參考文獻: [1] M. Golumbic and C. Monma, A generalization of interval graphs with tolerances, Congressus Numerantium, 35 (1982), pp. 321-331.
[2] M. Golumbic, D. Rotem, and J. Urrutia, Comparability graphs and intersection graphs, Discrete Math., 43 (1983), pp. 37-46.
[3] M. Golumbic and A. Trenk, Tolerance graphs, Cambridge Univ Pr, 2004.
[4] R. Hayward and R. Shamir, A note on tolerance graph recognition, Discrete Applied Mathematics, 143 (2004), pp. 307-311.
描述: 碩士
國立政治大學
應用數學研究所
96751006
98
資料來源: http://thesis.lib.nccu.edu.tw/record/#G0967510061
資料類型: thesis
Appears in Collections:學位論文

Files in This Item:
File Description SizeFormat
006101.pdf1.48 MBAdobe PDF2View/Open
Show full item record

Google ScholarTM

Check


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