Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PLANAR GRAPH LABELLING:
Reports tagged with Planar graph labelling:
TR21-114 | 29th July 2021
Henning Fernau, Kshitij Gajjar

The Space Complexity of Sum Labelling

Revisions: 1

A graph is called a sum graph if its vertices can be labelled by distinct positive integers such that there is an edge between two vertices if and only if the sum of their labels is the label of another vertex of the graph. Most papers on sum graphs consider ... more >>>




ISSN 1433-8092 | Imprint