The space complexity of sum labelling
From MaRDI portal
Publication:2140502
DOI10.1007/978-3-030-86593-1_16OpenAlexW3197880181MaRDI QIDQ2140502
Henning Fernau, Kshitij Gajjar
Publication date: 20 May 2022
Full work available at URL: https://arxiv.org/abs/2107.12973
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exclusive sum labeling of graphs: A survey
- Planar graphs and poset dimension
- Connected graphs which are not mod sum graphs
- Sum graphs over all the integers
- Characterisation of graphs with exclusive sum labelling
- Short encodings of planar graphs and maps
- A family of sparse graphs of large sum number
- Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8--10, 2020, Proceedings
- A sum labelling for the generalised friendship graph
- Planar graphs, via well-orderly maps and trees
- Some results on the spum and the integral spum of graphs
- Succinct Representation of Balanced Parentheses and Static Trees
- Product Graphs Are Sum Graphs
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- Implicat Representation of Graphs
- Universal codeword sets and representations of the integers
- Proximity-preserving labeling schemes
- Shorter Labeling Schemes for Planar Graphs
- Constructing Labeling Schemes Through Universal Matrices
- Combinatorial Geometry and Graph Theory
- k-Degenerate Graphs
- Minimal sum labeling of graphs
- On the sum number of wheels
- The sum number and integral sum number of complete bipartite graphs
- New formula for the sum number for the complete bipartite graphs
- Bounds on the number of isolates in sum graph labeling
This page was built for publication: The space complexity of sum labelling
