Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
Entanglement from Expansion: High Rank-Width in Deterministic Graphs
Tristan Cam, Cyril Gavoille, Yvan Le Borgne +1
Entanglement in quantum graph states is intrinsically linked to rank-width, a graph complexity measure introduced by Oum and Seymour. In this work, we enable the preparation of max…
cs.DM2026
Adjacency labelling for proper minor-closed graph classes
Vida Dujmović, Cyril Gavoille, Gwenaël Joret +3
We show that every proper minor-closed class of graphs admits a -bit adjacency labelling scheme. Equivalently, for every proper minor-closed class a…