On the public citation graph

The Cost of 2-Distinguishing Cartesian Powers

https://doi.org/10.37236/3223
0 signed · 23 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.20190openalex-snapshot
Distinguishing Cartesian powers of graphs
inferredcites →https://doi.org/10.1002/jgt.20368openalex-snapshot
The determining number of a Cartesian product
inferredcites →https://doi.org/10.1002/jgt.v53:3openalex-snapshot
inferredcites →https://doi.org/10.1016/j.disc.2003.11.018openalex-snapshot
The distinguishing number of the hypercube
inferredcites →https://doi.org/10.1016/j.ejc.2005.07.001openalex-snapshot
Cartesian powers of graphs can be distinguished by two labels
inferredcites →https://doi.org/10.1201/b10959openalex-snapshot
Handbook of Product Graphs
inferredcites →https://doi.org/10.26493/1855-3974.31.d93openalex-snapshot
Small label classes in 2-distinguishing labelings
inferredcites →https://doi.org/10.37236/1104openalex-snapshot
Identifying Graph Automorphisms Using Determining Sets
inferredcites →https://doi.org/10.37236/1242openalex-snapshot
Symmetry Breaking in Graphs
inferredcites →https://doi.org/10.37236/1984openalex-snapshot
Distinguishing Cartesian Powers of Graphs
inferredcites →https://doi.org/10.37236/938openalex-snapshot
Using Determining Sets to Distinguish Kneser Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-77983-2_5openalex-snapshot
Symmetry Parameters for Mycielskian Graphs
inferred← citeshttps://doi.org/10.1007/s11083-021-09583-2openalex-snapshot
The Distinguishing Number and Distinguishing Chromatic Number for Posets
inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.021openalex-snapshot
On the distinguishing number of cyclic tournaments: Towards the Albertson–Collins Conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112512openalex-snapshot
The cost of 2-distinguishing hypercubes
inferred← citeshttps://doi.org/10.1017/9781316576571.005openalex-snapshot
The Cost of Distinguishing Graphs
inferred← citeshttps://doi.org/10.18690/978-961-286-113-1.8openalex-snapshot
Distinguishing graphs of maximum valence 3
inferred← citeshttps://doi.org/10.26493/1855-3974.981.ff0openalex-snapshot
Improving upper bounds for the distinguishing index
inferred← citeshttps://doi.org/10.26493/2590-9770.1463.f59openalex-snapshot
Paint cost and the frugal distinguishing number
inferred← citeshttps://doi.org/10.26493/2590-9770.1481.29dopenalex-snapshot
Symmetry parameters of various hypercube families
inferred← citeshttps://doi.org/10.37236/7281openalex-snapshot
Distinguishing Graphs of Maximum Valence 3
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05549openalex-snapshot
Distinguishing Tournaments with Small Label Classes
inferred← citeshttps://doi.org/10.7151/dmgt.2438openalex-snapshot
Determining number and cost of generalized Mycielskian graphs
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.