On the public citation graph
List-Distinguishing Colorings of Graphs
0 signed · 25 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.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.1016/j.disc.2003.11.018openalex-snapshot
The distinguishing number of the hypercube
inferredcites →https://doi.org/10.1016/j.disc.2007.04.070openalex-snapshot
Distinguishing colorings of Cartesian products of complete graphs
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.1016/j.jalgebra.2006.01.045openalex-snapshot
Distinguishing labellings of group action on vector spaces and graphs
inferredcites →https://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of graphs
inferredcites →https://doi.org/10.1137/060651392openalex-snapshot
Distinguishing Chromatic Number of Cartesian Products of Graphs
inferredcites →https://doi.org/10.1142/9789811273117_0001openalex-snapshot
Introduction to Graph Theory
inferredcites →https://doi.org/10.37236/1361openalex-snapshot
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
inferredcites →https://doi.org/10.37236/1984openalex-snapshot
Distinguishing Cartesian Powers of 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-39219-2_20openalex-snapshot
List Distinguishing Number of $$p^{\text {th}}$$ Power of Hypercube and Cartesian Powers of a Graph
inferred← citeshttps://doi.org/10.1007/s11139-014-9664-6openalex-snapshot
On some asymptotic formulas in the theory of concave compositions
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.003openalex-snapshot
List distinguishing parameters of trees
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.006openalex-snapshot
The list distinguishing number of Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.03.001openalex-snapshot
List-distinguishing Cartesian products of cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114492openalex-snapshot
Tyshkevich's graph decomposition and the distinguishing numbers of unigraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.03.008openalex-snapshot
Extending precolorings to distinguish group actions
inferred← citeshttps://doi.org/10.48550/arxiv.1111.4989openalex-snapshot
List Distinguishing Parameters of Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1711.08887openalex-snapshot
Characterization of graphs with distinguishing number equal list distinguishing number
inferred← citeshttps://doi.org/10.7151/dmgt.1927openalex-snapshot
The list distinguishing number equals the distinguishing number for interval 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.