Planar Graph Diameter is a metric that quantifies the longest shortest path between any pair of vertices in a planar graph, distinguished by its restriction to graphs that can be embedded in the plane without edge crossings.
64
Publications
2.6K
Citations
125
Authors
69
Institutions
Publications per year
2017–2026
7
Parents
Publications
64
Planar graphs and poset dimension
Walter Schnyder · Order · 1989 · 269 citations
A combinatorial condition for planar graphs
Saunders Mac Lane · Fundamenta Mathematicae · 1937 · 164 citations · Full text
Unit Graphs Associated with Rings
Nahid Ashrafi, Hamid Reza Maimani, M. R. Pournaki et al. · Communications in Algebra · 2010 · 155 citations
1–5 of 64
Authors
125
- KS
5
h-index
- MA
5
h-index
- XZ
3
h-index
- PH
3
h-index
- SC
2
h-index
1–5 of 125
Institutions
69
University of Victoria
Victoria, Canada
4 h-index
4 publications
154 citations
University of Calgary
Calgary, Canada
4 h-index
4 publications
154 citations
Simon Fraser University
Burnaby, Canada
3 h-index
4 publications
108 citations
University of Johannesburg
Johannesburg, South Africa
3 h-index
3 publications
66 citations
RWTH Aachen University
Aachen, Germany
2 h-index
6 publications
102 citations
Royal Holloway University of London
Egham, United Kingdom
2 h-index
2 publications
55 citations
University of KwaZulu-Natal
Durban, South Africa
2 h-index
3 publications
85 citations
Zhengzhou University
Zhengzhou, China
2 h-index
2 publications
66 citations
1–8 of 69
Venues
- Discrete Mathematics
12 publications · 289 citations
11
h-index
- Journal of Combinatorial Theory Series B
6 publications · 135 citations
6
h-index
- Journal of Graph Theory
5 publications · 180 citations
5
h-index
- Discrete Applied Mathematics
3 publications · 105 citations
3
h-index
- European Journal of Combinatorics
3 publications · 79 citations
3
h-index
1–5