On the public citation graph
The Distinguishing Chromatic Number
0 signed · 98 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.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.37236/1816openalex-snapshot
Distinguishing Numbers for Graphs and Groups
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.22809openalex-snapshot
Distinguishing infinite graphs with bounded degrees
inferred← citeshttps://doi.org/10.1007/978-3-030-25070-6_4openalex-snapshot
Strongly n-e.c. Graphs and Independent Distinguishing Labellings
inferred← citeshttps://doi.org/10.1007/978-3-319-64419-6_44openalex-snapshot
The Distinguishing Number of Kronecker Product of Two Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/s00009-023-02410-5openalex-snapshot
On the Comparison of the Distinguishing Coloring and the Locating Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-010-0923-zopenalex-snapshot
On the Automorphic Chromatic Index of a Graph
inferred← citeshttps://doi.org/10.1007/s00373-013-1321-0openalex-snapshot
Upper Bounds for the Automorphic Chromatic Index of a Graph
inferred← citeshttps://doi.org/10.1007/s00373-015-1620-8openalex-snapshot
3-Regular Maps on Closed Surfaces are Nearly Distinguishing 3-Colorable with Few Exceptions
inferred← citeshttps://doi.org/10.1007/s00373-017-1788-1openalex-snapshot
Bipartite Polyhedral Maps on Closed Surfaces are Distinguishing 3-Colorable with Few Exceptions
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/s00454-008-9066-xopenalex-snapshot
Automorphisms and Distinguishing Numbers of Geometric Cliques
inferred← citeshttps://doi.org/10.1007/s00605-020-01420-9openalex-snapshot
Asymmetrizing trees of maximum valence $$2^{\aleph _0}$$
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.1007/s13226-021-00004-zopenalex-snapshot
Equitable distinguishing chromatic number
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.akcej.2018.08.006openalex-snapshot
The distinguishing number and the distinguishing index of line and graphoidal graph(s)
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.008openalex-snapshot
The chromatic distinguishing index of certain graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2022.126939openalex-snapshot
Proper distinguishing arc-colourings of symmetric digraphs
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129310openalex-snapshot
Distinguishing infinite star-free graphs
inferred← citeshttps://doi.org/10.1016/j.bulsci.2021.102975openalex-snapshot
Distinguishing number of hierarchical products of graphs
inferred← citeshttps://doi.org/10.1016/j.bulsci.2024.103458openalex-snapshot
Transitive coloring of graphs
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.2018.10.034openalex-snapshot
Upper bounds on the locating chromatic number of trees
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.007openalex-snapshot
Distinguishing numbers and distinguishing indices of oriented graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.056openalex-snapshot
The distinguishing number of the augmented cube and hypercube powers
inferred← citeshttps://doi.org/10.1016/j.disc.2009.04.004openalex-snapshot
On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.015openalex-snapshot
deBruijn-like sequences and the irregular chromatic number of paths and cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.021openalex-snapshot
The distinguishing chromatic number of Cartesian products of two complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.12.013openalex-snapshot
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
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.disc.2020.111984openalex-snapshot
Number of distinguishing colorings and partitions
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.2007.11.018openalex-snapshot
The distinguishing number 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.1016/j.ejc.2018.03.008openalex-snapshot
Extending precolorings to distinguish group actions
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2006.01.045openalex-snapshot
Distinguishing labellings of group action on vector spaces and graphs
inferred← citeshttps://doi.org/10.1080/02522667.2020.1773614openalex-snapshot
Distinguishing critical graphs
inferred← citeshttps://doi.org/10.1080/09728600.2023.2250843openalex-snapshot
On the distinguishing chromatic number of the Kronecker products of graphs
inferred← citeshttps://doi.org/10.1109/itsc.2007.4357816openalex-snapshot
Marker-Based Localizing for Indoor Navigation
inferred← citeshttps://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
inferred← citeshttps://doi.org/10.1134/s1990478921010014openalex-snapshot
The Distinguishing Numbers and the Distinguishing Indexes of Cayley Graphs
inferred← citeshttps://doi.org/10.1137/060651392openalex-snapshot
Distinguishing Chromatic Number of Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.1137/07068686xopenalex-snapshot
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
inferred← citeshttps://doi.org/10.1137/080728640openalex-snapshot
Breaking the Symmetries of the Book Graph and the Generalized Petersen Graph
inferred← citeshttps://doi.org/10.18690/978-961-286-113-1.8openalex-snapshot
Distinguishing graphs of maximum valence 3
inferred← citeshttps://doi.org/10.23860/diss-guillame-jean-2019openalex-snapshot
CLOSURE UNDER THE MAJORIZATION RELATION AND THE DISTINGUISHING CHROMATIC NUMBER OF CIRCULANT GRAPHS
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.1849.148openalex-snapshot
Distinguishing numbers of finite 4-valent vertex-transitive graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.199.a0eopenalex-snapshot
3-Connected planar graphs are 5-distinguishing colorable with two exceptions
inferred← citeshttps://doi.org/10.26493/1855-3974.2354.616openalex-snapshot
Coarse distinguishability of graphs with symmetric growth
inferred← citeshttps://doi.org/10.26493/1855-3974.2878.a61openalex-snapshot
On asymmetric colourings of graphs with bounded degrees and infinite motion
inferred← citeshttps://doi.org/10.26493/1855-3974.751.9a8openalex-snapshot
Distinguishing graphs by total colourings
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.26493/2590-9770.1472.24bopenalex-snapshot
Distinguishing arc-colourings of symmetric digraphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1504.f7aopenalex-snapshot
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
inferred← citeshttps://doi.org/10.3390/sym10080332openalex-snapshot
On the Distinguishing Number of Functigraphs
inferred← citeshttps://doi.org/10.37236/165openalex-snapshot
Distinguishing Chromatic Numbers of Bipartite Graphs
inferred← citeshttps://doi.org/10.37236/177openalex-snapshot
Bounds on the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/2117openalex-snapshot
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/2213openalex-snapshot
Graph Labelings and Continuous Factors of Dynamical Systems
inferred← citeshttps://doi.org/10.37236/2407openalex-snapshot
Graphs with Large Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/3046openalex-snapshot
Bounding the Distinguishing Number of Infinite Graphs and Permutation Groups
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.37236/7281openalex-snapshot
Distinguishing Graphs of Maximum Valence 3
inferred← citeshttps://doi.org/10.37236/938openalex-snapshot
Using Determining Sets to Distinguish Kneser Graphs
inferred← citeshttps://doi.org/10.37236/947openalex-snapshot
Distinguishability of Locally Finite Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1111.4989openalex-snapshot
List Distinguishing Parameters of Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0416openalex-snapshot
Distinguishing homomorphisms of infinite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1703.01874openalex-snapshot
Distinguishing number and distinguishing index of strong product of two graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1704.04150openalex-snapshot
The distinguishing number and the distinguishing index of Cayley graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1707.06161openalex-snapshot
The distinguishing number (index) and the domination number of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1709.10021openalex-snapshot
The distinguishing chromatic number of bipartite graphs of girth at least six
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.48550/arxiv.1807.04372openalex-snapshot
Fixing Numbers of Graphs and Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1807.09256openalex-snapshot
Limit aperiodic and repetitive colorings of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2001.06300openalex-snapshot
Distinguishing simple groups
inferred← citeshttps://doi.org/10.48550/arxiv.2005.09716openalex-snapshot
Coarse distinguishability of graphs with symmetric growth
inferred← citeshttps://doi.org/10.5614//ejgta.2021.9.1.7openalex-snapshot
Distinguishing index of Kronecker product of two graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2022.10.2.5openalex-snapshot
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2024.12.1.6openalex-snapshot
Edge-locating coloring of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2162openalex-snapshot
Trees with distinguishing index equal distinguishing number plus one
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.