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: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/77381 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Mahidol University |