透過您的圖書館登入
IP:3.145.178.240

並列摘要


A graph G = (V, E) is a tolerance graph if there is a set I = {I(subscript υ)|υ ∈ V} of closed real interval and a set т = { т(subscript υ)|υ ∈ V} of positive real numbers such that (x, y) ∈ E ↔ |I(subscript x)∩I(subscript y)| ≥ min{ т(subscript x), т(subscript y)}. We show that if G is a 2-connected maximal outer-planar graph with more than two vertices of degree 2, then G has S3 as an induced subgraph. We provide a characterization of the class of 2-connected maximal outer-planar graphs that are bounded tolerance graphs.

被引用紀錄


Yao, S. C. (2013). 在弦環網路上建構完全獨立擴展樹 [master's thesis, National Taipei University of Business]. Airiti Library. https://doi.org/10.6818/NTUB.2013.00006
陳宏吉(2011)。案例式推理系統應用於數值預測之研究〔碩士論文,國立屏東科技大學〕。華藝線上圖書館。https://doi.org/10.6346/NPUST.2011.00060
陳榮昌(2007)。利用融合策略結合多重學生模式之貝式網路適性學習系統研發-以複合圖形為例〔碩士論文,亞洲大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0118-0807200916282511

延伸閱讀