On the structure of locally outerplanar graphs

Hung Lung Wang, Chun Yu Tseng, Jou Ming Chang

研究成果: 雜誌貢獻期刊論文同行評審

摘要

For k ≥ 3, a convex geometric graph is called k-locally outerplanar if no path of length k intersects itself. In [D. Boutin, Convex Geometric Graphs with No Short Self-intersecting Path, Congressus Numerantium 160 (2003) 205-214], Boutin stated the results of the degeneracy for 3-locally outerplanar graphs. Later, in [D. Boutin, Structure and Properties of Locally Outerplanar Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 60 (2007) 169-180], a structural property on k-locally outerplanar graphs was proposed. These results are based on the existence of "minimal corner pairs". In this paper, we show that a "minimal corner pair" may not exist and give a counterexample to disprove the structural property. Furthermore, we generalize the result on the degeneracy with respect to k-locally outerplanar graphs.

原文英語
頁(從 - 到)1212-1215
頁數4
期刊IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E98A
發行號6
DOIs
出版狀態已發佈 - 2015 六月 1
對外發佈

ASJC Scopus subject areas

  • 訊號處理
  • 電腦繪圖與電腦輔助設計
  • 電氣與電子工程
  • 應用數學

指紋

深入研究「On the structure of locally outerplanar graphs」主題。共同形成了獨特的指紋。

引用此