arXiv (OAI)open access
Polynomial-time recognition and maximum independent set in Burling graphs
combinatorics, discrete mathematics
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 173213
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.