On planarity of the double vertex graphs of connected graphs
This thesis is based on the article "Planarity of Double Vertex Graphs" by Y. Alavi, M. Behzad and J. E. Simpson of the book entitled "Graph Theory, Combinatorics, Algorithms, and Applications". This paper focuses on the planarity of the double vertex graph of a connected graph....
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2002
|
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/17231 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | This thesis is based on the article "Planarity of Double Vertex Graphs" by Y. Alavi, M. Behzad and J. E. Simpson of the book entitled "Graph Theory, Combinatorics, Algorithms, and Applications". This paper focuses on the planarity of the double vertex graph of a connected graph. It is an exposition on selected propositions and it gives detailed proofs, illustrations and examples. It supplies conditions on evaluating a given graph to determine whether its double vertex graph is either planar or non-planar. |
|---|