On the public citation graph
On Computing the Distinguishing Numbers of Trees and Forests
0 signed · 43 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-1-4612-4400-4openalex-snapshot
The Design and Analysis of Algorithms
inferredcites →https://doi.org/10.1007/s10801-006-0006-7openalex-snapshot
The distinguishing number of the direct product and wreath product action
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.2006.09.056openalex-snapshot
The distinguishing number of the augmented cube and hypercube powers
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.37236/1096openalex-snapshot
The Maximum Distinguishing Number of a Group
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/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/jcd.21677openalex-snapshot
Nonsymmetric 2‐(v,k,λ) designs, with (r,λ) = 1, admitting a solvable flag‐transitive automorphism group of affine type
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_7openalex-snapshot
Generation of Colourings and Distinguishing Colourings of Graphs
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.02.001openalex-snapshot
Trees with distinguishing number two
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.dam.2012.10.003openalex-snapshot
List distinguishing parameters of trees
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.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.11.021openalex-snapshot
The distinguishing chromatic number of Cartesian products of two complete 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.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.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.1137/07068686xopenalex-snapshot
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
inferred← citeshttps://doi.org/10.32968/psaie.2019.003openalex-snapshot
Cost Analysis of the Prefix Tree Data Structure
inferred← citeshttps://doi.org/10.3390/sym10080332openalex-snapshot
On the Distinguishing Number of Functigraphs
inferred← citeshttps://doi.org/10.3390/sym11101300openalex-snapshot
A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms
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.1406.3844openalex-snapshot
Distinguishing Number for some Circulant Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1710.08143openalex-snapshot
The distinguishing index of graphs with at least one cycle is not more than its distinguishing number
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.5614//ejgta.2021.9.1.7openalex-snapshot
Distinguishing index of Kronecker product of two graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1927openalex-snapshot
The list distinguishing number equals the distinguishing number for interval 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.