10 citations · 10 across the 1 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
On the Simultaneous Minimum Spanning Trees Problem
Matěj Konečný, Stanislav Kučera, Jana Novotná +4
Simultaneous Embedding with Fixed Edges (SEFE) is a problem where given planar graphs we ask whether they can be simultaneously embedded so that the embedding of each graph is…
cs.DM2017
Minimal Sum Labeling of Graphs
Matěj Konečný, Stanislav Kučera, Jana Novotná +3
A graph is called a sum graph if there is a so-called sum labeling of , i.e. an injective function such that for every it h…