
doi: 10.37236/646
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.
clustered embedding, Directed graphs (digraphs), tournaments, excluded minors, Graph minors, planarity, digraph, Planar graphs; geometric and topological aspects of graph theory, clustered planar graphs, 2604 Applied Mathematics, obstructions, clustered planar directed graph, 2607 Discrete Mathematics and Combinatorics, 2608 Geometry and Topology, 2614 Theoretical Computer Science, 1703 Computational Theory and Mathematics
clustered embedding, Directed graphs (digraphs), tournaments, excluded minors, Graph minors, planarity, digraph, Planar graphs; geometric and topological aspects of graph theory, clustered planar graphs, 2604 Applied Mathematics, obstructions, clustered planar directed graph, 2607 Discrete Mathematics and Combinatorics, 2608 Geometry and Topology, 2614 Theoretical Computer Science, 1703 Computational Theory and Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
