arXiv (All)
open access
Awesome graph parameters
For a graph $G$, we denote by $α(G)$ the size of a maximum independent set and by $ω(G)$ the size of a maximum clique in $G$. Our paper lies on the edge of two lines of research, related to $α$ and $ω$, respectively. One of them studies $α$-variants of graph parameters, such as $α$-treewidth or $α$-
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
- Outer-clique Roman dominating function in graphs#72023
- Bipartite Turán Numbers of Trees and Star Forests#1118674
- A Note on Weak Saturation Number of Trees#1122912
- Separating Notions of Graph Width: the Adaptive, Normal, Linear, Entropic, and Submodular Width#1169673
- Separating Notions of Graph Width: the Adaptive, Normal, Linear, Entropic, and Submodular Width#1145185
Record · ID 1063805
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