Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.
Rank-width: Algorithmic and structural results
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Rank-width is a width parameter of graphs describing whether it is possible to decompose a graph into a tree-like structure by `simple' cuts. This survey aims to summarize known algorithmic and structural results on rank-width of graphs.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Structure of Circle Graph States
Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.