arXiv (All)open access
Recognizability equals CMSO-definability for graphs of rank-width at most two
combinatorics, logic in computer science
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 998295
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.