arXiv (All)
open access
Recognizability of Being Point Determining
A graph $G$ is point determining, if no two vertices have the same neighborhoods. In this paper, we show that this property is recognizable from the deck of cards of a graph.
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
- A Brooks-like result for graph powers $#983875
- Large cardinal characterizations via compactness for list colourings#662075
- An 18-colour bound for locally irregular decompositions#987111
- Default-Distance Entropy and Metric Dimension in Finite Geometries#781079
- Default-Distance Entropy and Metric Dimension in Finite Geometries#779704
Record · ID 1129396
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