On the public citation graph
Bounds for Identifying Codes in Terms of Degree Parameters
0 signed · 42 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-04016-0openalex-snapshot
Graph Colouring and the Probabilistic Method
inferredcites →https://doi.org/10.1007/bf01275671openalex-snapshot
Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)
inferredcites →https://doi.org/10.1007/s00493-007-2020-3openalex-snapshot
Total domination of graphs and small transversals of hypergraphs
inferredcites →https://doi.org/10.1007/s11036-008-0105-xopenalex-snapshot
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes
inferredcites →https://doi.org/10.1016/j.dam.2006.03.011openalex-snapshot
On graphs on n vertices having an identifying code of cardinality ⌈log2(n+1)⌉
inferredcites →https://doi.org/10.1016/j.dam.2012.02.009openalex-snapshot
On the size of identifying codes in triangle-free graphs
inferredcites →https://doi.org/10.1016/j.disc.2005.09.027openalex-snapshot
Extremal cardinalities for identifying and locating-dominating codes in graphs
inferredcites →https://doi.org/10.1016/j.disc.2005.09.035openalex-snapshot
On graphs having a V⧹{x} set as an identifying code
inferredcites →https://doi.org/10.1016/j.disc.2006.07.041openalex-snapshot
Codes identifying sets of vertices in random networks
inferredcites →https://doi.org/10.1016/j.ejc.2004.09.005openalex-snapshot
Identifying codes of cycles
inferredcites →https://doi.org/10.1016/j.ejc.2009.11.012openalex-snapshot
Minimal identifying codes in trees and planar graphs with large girth
inferredcites →https://doi.org/10.1016/j.ejc.2011.01.002openalex-snapshot
Extremal graphs for the identifying code problem
inferredcites →https://doi.org/10.1016/s0095-8956(81)80022-6openalex-snapshot
The asymptotic distribution of short cycles in random regular graphs
inferredcites →https://doi.org/10.1016/s0304-3975(02)00536-4openalex-snapshot
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
inferredcites →https://doi.org/10.1017/s0963548309990344openalex-snapshot
Identifying and Locating–Dominating Codes in (Random) Geometric Networks
inferredcites →https://doi.org/10.1017/s0963548320000279openalex-snapshot
Independent dominating sets in graphs of girth five
inferredcites →https://doi.org/10.1023/a:1022444205860openalex-snapshot
Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
inferredcites →https://doi.org/10.1109/18.661507openalex-snapshot
On a new class of codes for identifying vertices in graphs
inferredcites →https://doi.org/10.1109/broadnets.2007.4550425openalex-snapshot
Joint monitoring and routing in wireless sensor networks using robust identifying codes
inferredcites →https://doi.org/10.1109/infcom.2003.1208941openalex-snapshot
Robust location detection in emergency sensor networks
inferredcites →https://doi.org/10.1111/j.1475-3995.2009.00750.xopenalex-snapshot
Complexity results for identifying codes in planar graphs
inferredcites →https://doi.org/10.1186/1471-2105-7-108openalex-snapshot
A quantitative analysis of secondary RNA structure using domination based parameters on trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.70025openalex-snapshot
Identifying Codes in Triangle‐Free Graphs of Bounded Maximum Degree
inferred← citeshttps://doi.org/10.1002/rsa.21143openalex-snapshot
A simple algorithm for graph reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-030-51117-3_8openalex-snapshot
Locating-Domination and Identification
inferred← citeshttps://doi.org/10.1007/s00373-019-02018-1openalex-snapshot
Bounds on the Identifying Codes in Trees
inferred← citeshttps://doi.org/10.1016/j.dam.2012.02.009openalex-snapshot
On the size of identifying codes in triangle-free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.03.018openalex-snapshot
Identifying codes and searching with balls in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.12.018openalex-snapshot
Extremal digraphs for open neighbourhood location-domination and identifying codes
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.032openalex-snapshot
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112475openalex-snapshot
Strong identification codes for graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114826openalex-snapshot
Identifying codes in graphs of given maximum degree: Characterizing trees
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.02.029openalex-snapshot
On the limiting distribution of the metric dimension for random forests
inferred← citeshttps://doi.org/10.1016/j.procs.2023.08.225openalex-snapshot
Identifying codes in bipartite graphs of given maximum degree
inferred← citeshttps://doi.org/10.1137/22m148999xopenalex-snapshot
Revisiting and Improving Upper Bounds for Identifying Codes
inferred← citeshttps://doi.org/10.37236/11342openalex-snapshot
Bounds and Extremal Graphs for Total Dominating Identifying Codes
inferred← citeshttps://doi.org/10.37236/4562openalex-snapshot
Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5
inferred← citeshttps://doi.org/10.4310/joc.2017.v8.n1.a3openalex-snapshot
Random subgraphs make identification affordable
inferred← citeshttps://doi.org/10.48550/arxiv.2112.04549openalex-snapshot
A Simple Algorithm for Graph Reconstruction
inferred← citeshttps://doi.org/10.5821/dissertation-2117-96089openalex-snapshot
Random combinatorial structures with low dependencies : existence and enumeration
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.