
Improved Bounds for Track Numbers of Planar Graphs
A track layout of a graph consists of a vertex coloring and of a total o...
read it

Upper bounds on the average number of colors in the nonequivalent colorings of a graph
A coloring of a graph is an assignment of colors to its vertices such th...
read it

Vertex nomination between graphs via spectral embedding and quadratic programming
Given a network and a subset of interesting vertices whose identities ar...
read it

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs
A set U⊆^2 is nuniversal if all nvertex planar graphs have a planar st...
read it

Colored Pointset Embeddings of Acyclic Graphs
We show that any planar drawing of a forest of three stars whose vertice...
read it

The Space Complexity of Sum Labelling
A graph is called a sum graph if its vertices can be labelled by distinc...
read it

On Ramsey numbers of hedgehogs
The hedgehog H_t is a 3uniform hypergraph on vertices 1,...,t+t2 such t...
read it
Simultaneous Embedding of Colored Graphs
A set of colored graphs are compatible, if for every color i, the number of vertices of color i is the same in every graph. A simultaneous embedding of k compatibly colored graphs, each with n vertices, consists of k planar polyline drawings of these graphs such that the vertices of the same color are mapped to a common set of vertex locations. We prove that simultaneous embedding of k∈ o(loglog n) colored planar graphs, each with n vertices, can always be computed with a sublinear number of bends per edge. Specifically, we show an O(min{c, n^11/γ}) upper bound on the number of bends per edge, where γ = 2^⌈ k/2 ⌉ and c is the total number of colors. Our bound, which results from a better analysis of a previously known algorithm [Durocher and Mondal, SIAM J. Discrete Math., 32(4), 2018], improves the bound for k, as well as the bend complexity by a factor of √(2)^k. The algorithm can be generalized to obtain small universal point sets for colored graphs. We prove that n⌈ c/b ⌉ vertex locations, where b≥ 1, suffice to embed any set of compatibly colored nvertex planar graphs with bend complexity O(b), where c is the number of colors.
READ FULL TEXT
Comments
There are no comments yet.