arXiv (All)
open access
Computing the Helly Number, Radon Number and Rank in Cycle Convexity
In this paper, we investigate three fundamental convexity parameters of graphs under cycle convexity, namely the Helly number, Radon number, and rank. We first study the computational complexity of these parameters. For each of these parameters, we consider the associated threshold decision problem
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
- Tree-independence number of $P_5$-free graphs with no large bicliques#1035482
- Consensus Time in 3-Majority and 2-Choices Is Determined by the Maximum Initial Opinion Density#1130575
- On the Parameterized Complexity of $s$-Club Cluster Edge Deletion#793494
- On the Parameterized Complexity of $s$-Club Cluster Edge Deletion#789490
- A note on vertex-critical induced subgraphs of shift graphs#1052081
Record · ID 1119309
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