Internally 4-Connected Graphs with No {Cube, V<inf>8</inf>}-Minor
A simple graph is a minor of another if the first is obtained from the second by deleting vertices, deleting edges, contracting edges, and deleting loops and parallel edges that are created when we contract edges. A cube is an internally 4-connected planar graph with eight vertices and twelve edges...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 出版: |
2022
|
| 主題: | |
| 在線閱讀: | https://repository.li.mahidol.ac.th/handle/123456789/77381 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|