arXiv (All)
open access
Identifying codes in triangle-free graphs of bounded maximum degree
An identifying code of a closed-twin-free graph $G$ is a set $S$ of vertices of $G$ such that any two vertices in $G$ have a distinct, nonempty intersection between their closed neighborhood and $S$. It was conjectured that there exists a constant $c$ such that for every connected closed-twin-free g
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
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree#1186299
- 4-cycle-free induced subgraphs of grid graphs#1325123
- Erdős-Hajnal conjecture beyond five-vertex graphs#798944
- Erdős-Hajnal conjecture beyond five-vertex graphs#797530
- Longest cycles intersect linearly in highly connected graphs#1034521
Record · ID 1187198
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