在這篇論文中，我們針對2-連通的最大外平面圖而且是二分圖的圖形，討論
其容忍表示法，並找到它的所有禁止子圖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.
| Identifer | oai:union.ndltd.org:CHENGCHI/G0967510061 |
| Creators | 賴昱儒 |
| Publisher | 國立政治大學 |
| Source Sets | National Chengchi University Libraries |
| Language | 英文 |
| Detected Language | English |
| Type | text |
| Rights | Copyright © nccu library on behalf of the copyright holders |
Page generated in 0.0017 seconds