Results 21 to 30 of about 424,447 (182)
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction?
David Bremner +8 more
doaj +1 more source
The structure and the list 3-dynamic coloring of outer-1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge.
Yan Li, Xin Zhang
doaj +1 more source
A Mixed-Integer Program for Drawing Orthogonal Hyperedges in a Hierarchical Hypergraph
Mathematics, 2022 This paper presents a new formulation and solution of a mixed-integer program for the hierarchical orthogonal hypergraph drawing problem, and the number of hyperedge crossings is minimized. The novel feature of the model is in combining several stages of
Gregory Fridman +3 more
doaj +1 more source
Drawing Planar Graphs with a Prescribed Inner Face [PDF]
, 2013 Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of ...
C.A. Duncan +7 more
core +2 more sources
Experimental analysis of the accessibility of drawings with few segments [PDF]
, 2017 The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges ...
Kindermann, Philipp +2 more
core +9 more sources
Annular and pants thrackles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices.
Grace Misereh, Yuri Nikolayevsky
doaj +1 more source
Minimal Graphs with Respect to Geometric Distance Realizability
Discussiones Mathematicae Graph Theory, 2021 A graph G is minimal non-unit-distance graph if there is no drawing of G in Euclidean plane having all edges of unit length, but, for each edge e of G, G − e has such a drawing.
Madaras Tomáš, Široczki Pavol
doaj +1 more source
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings [PDF]
, 2014 Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations.
A.C. Yao +10 more
core +4 more sources
Coloring Drawings of Graphs [PDF]
The Electronic Journal of Combinatorics, 2022 We consider cell colorings of drawings of graphs in the plane. Given a multi-graph $G$ together with a drawing $\Gamma(G)$ in the plane with only finitely many crossings, we define a cell $k$-coloring of $\Gamma(G)$ to be a coloring of the maximal connected regions of the drawing, the cells, with $k$ colors such that adjacent cells have different ...
Hertrich, Christoph +2 more
openaire +2 more sources
Mental-Map Preserving Visualisation of Partitioned Networks in Vanted
Journal of Integrative Bioinformatics, 2019 Biological networks can be large and complex, often consisting of different sub-networks or parts. Separation of networks into parts, network partitioning and layouts of overview and sub-graphs are of importance for understandable visualisations of those
Garkov Dimitar +3 more
doaj +1 more source