On the public citation graph

Bounds on the Distinguishing Chromatic Number

https://doi.org/10.37236/177
0 signed · 28 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.1016/j.jalgebra.2006.01.045openalex-snapshot
Distinguishing labellings of group action on vector spaces and graphs
inferredcites →https://doi.org/10.1016/s0012-365x(98)00167-8openalex-snapshot
On the local distinguishing numbers of cycles
inferredcites →https://doi.org/10.1016/s0021-9800(68)80017-1openalex-snapshot
The group of an X-join of graphs
inferredcites →https://doi.org/10.1112/jlms/53.2.243openalex-snapshot
The Minimal Base Size of Primitive Solvable Permutation Groups
inferredcites →https://doi.org/10.1137/060651392openalex-snapshot
Distinguishing Chromatic Number of Cartesian Products of Graphs
inferredcites →https://doi.org/10.2140/pjm.1963.13.215openalex-snapshot
Centers of purity in abelian groups
inferredcites →https://doi.org/10.2140/pjm.1963.13.657openalex-snapshot
On subgroups of an Abelian group maximal disjoint from a given subgroup
inferredcites →https://doi.org/10.37236/1042openalex-snapshot
The Distinguishing Chromatic Number
inferredcites →https://doi.org/10.37236/1242openalex-snapshot
Symmetry Breaking in Graphs
inferredcites →https://doi.org/10.37236/1816openalex-snapshot
Distinguishing Numbers for Graphs and Groups
inferredcites →https://doi.org/10.37236/947openalex-snapshot
Distinguishability of Locally Finite Trees
inferredcites →https://doi.org/10.4153/cjm-1957-060-7openalex-snapshot
Graphs with Given Group and Given Graph-Theoretical Properties

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00373-025-02920-xopenalex-snapshot
Upper Bounds for the List-Distinguishing Chromatic Number
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.akcej.2018.01.007openalex-snapshot
On the local distinguishing chromatic number
inferred← citeshttps://doi.org/10.1016/j.disc.2017.06.002openalex-snapshot
Distinguishing chromatic number of random Cayley graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.05.016openalex-snapshot
Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.11.003openalex-snapshot
Distinguishing graphs by edge-colourings
inferred← citeshttps://doi.org/10.1201/b16132-37openalex-snapshot
Automorphisms
inferred← citeshttps://doi.org/10.26493/1855-3974.1435.c71openalex-snapshot
Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group
inferred← citeshttps://doi.org/10.26493/1855-3974.848.669openalex-snapshot
χ_D(G), |Aut(G)|, and a variant of the motion lemma
inferred← citeshttps://doi.org/10.26493/1855-3974.981.ff0openalex-snapshot
Improving upper bounds for the distinguishing index
inferred← citeshttps://doi.org/10.37236/2117openalex-snapshot
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/2407openalex-snapshot
Graphs with Large Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/3066openalex-snapshot
The Distinguishing Chromatic Number of Kneser Graphs
inferred← citeshttps://doi.org/10.37236/7170openalex-snapshot
Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5
inferred← citeshttps://doi.org/10.48550/arxiv.1203.5765openalex-snapshot
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0416openalex-snapshot
Distinguishing homomorphisms of infinite 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.