The space complexity of sum labelling
From MaRDI portal
Publication:6056630
DOI10.1007/s00224-023-10130-2OpenAlexW3183221368MaRDI QIDQ6056630
Henning Fernau, Kshitij Gajjar
Publication date: 30 October 2023
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-023-10130-2
Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Unnamed Item
- 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
- The early history of the factorial function
- Connected graphs which are not mod sum graphs
- Sum graphs over all the integers
- A dynamic survey of graph labeling
- 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
- The space complexity of sum labelling
- 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
- Adjacency Labelling for Planar Graphs (and Beyond)
- 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
