Name
Abstract | ||
|---|---|---|
A planar digraph D is clustered planar if in some planar embedding of D we have at each vertex the in-arcs occurring sequentially in the local rotation. By supplementing the operations used to form the usual minors in Kuratowski's theorem, clustered planar digraphs are characterised. |
Year | Venue | Field |
|---|---|---|
2011 | ELECTRONIC JOURNAL OF COMBINATORICS | Discrete mathematics,Combinatorics,Planarity testing,Vertex (geometry),Kuratowski's theorem,Planar embedding,Planar straight-line graph,Planar,Digraph,Mathematics |
DocType | Volume | Issue |
Journal | 18.0 | 1.0 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jamie Sneddon | 1 | 0 | 0.34 |
| C. Paul Bonnington | 2 | 100 | 19.95 |