Enlighten Publications
metadata only
On the algorithmic complexity of twelve covering and independence parameters of graphs
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Asymptotics of the Brown--Erdős--Sós problem at integer exponents#1142411
- On the Turán number of the expansion of the book#822329
- The coarse Erdős-Pósa theorem#1077343
- Turán-type extremal problems for unbalanced signed graphs#1011899
- Counterexamples to two conjectures on the diameter of clique-free graphs#926274
Record · ID 652635
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive