Logical labeling schemes

DOI10.1016/j.disc.2023.113565zbMath1518.05162OpenAlexW4381434840MaRDI QIDQ6172301

Maurice Chandoo

Publication date: 19 July 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://www.repo.uni-hannover.de/handle/123456789/12057

zbMATH Keywords

structural graph theoryimplicit representationsgraph class reduction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sphere and dot product representations of graphs
• Logical number theory I. An introduction
• Dot product representations of graphs
• Efficient graph representations
• The speed of hereditary properties of graphs
• Integer realizations of disk and segment graphs
• A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
• A semi-algebraic version of Zarankiewicz's problem
• Implicat Representation of Graphs
• Optimal Induced Universal Graphs and Adjacency Labeling for Trees
• Boundary Properties of Factorial Classes of Graphs
• Adjacency Labelling for Planar Graphs (and Beyond)
• The structure and the number of \(P_7\)-free bipartite graphs
• Graph functionality
• Optimal labelling schemes for adjacency, comparability, and reachability

This page was built for publication: Logical labeling schemes