Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Distances in planar graphs
In graph theory, the degree diameter problem asks for the maximum number of vertices a graph with given maximum degree and diameter can have. The face-degree of a face in plane graph is the length of the shortest closed walk traversing the boundary of the face. A plane graph is ρ-face-degree regular...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Mathematics and Applied Mathematics
2022
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|