Optimal adjacency labels for subgraphs of Cartesian products
From MaRDI portal
Publication:6581611
DOI10.1137/23m1587713zbMATH Open1544.05093MaRDI QIDQ6581611
Louis Esperet, Victor Zamaraev, Nathaniel Harms
Publication date: 31 July 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Local representations using very short labels
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Efficient graph representations
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- On the power of quantum fingerprinting
- Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.)
- Implicat Representation of Graphs
- On density of subgraphs of Cartesian products
- Determination of two vectors from the sum
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- Graph functionality
- Randomized communication and implicit graph representations
- Graph parameters, implicit representations and factorial properties
- Optimal adjacency labels for subgraphs of Cartesian products
This page was built for publication: Optimal adjacency labels for subgraphs of Cartesian products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581611)
