Local Equivalence Classes of Distance-Hereditary Graphs using Split Decompositions
math.CO, cs.DM, quant-ph
Submitted: 2026-02-27
Updated: 2026-02-27
Terminology
Sources
- Is Graph Local Complementation Inherently Sequential?
- Complexity of graph-state preparation by Clifford circuits
- Stabilizer codes can be realized as graph codes
- Minimising the number of edges in LC-equivalent graph states
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality