Name
Abstract | ||
|---|---|---|
We show that a digraph is upward planar if and only if its biconnected components have certain properties. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-31843-9_30 | Journal of Graph Algorithms and Applications |
Keywords | Field | DocType |
upward planar,certain property,upward planar digraph,biconnected component | Discrete mathematics,Combinatorics,Planar,If and only if,Mathematics,Digraph | Conference |
Volume | Issue | ISSN |
11 | 1 | 0302-9743 |
ISBN | Citations | PageRank |
3-540-24528-6 | 4 | 0.48 |
References | Authors | |
14 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patrick Healy | 1 | 21 | 2.63 |
| Karol Lynch | 2 | 25 | 2.20 |