On the public citation graph
Distinguishing Infinite Graphs
0 signed · 68 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.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.37236/1037openalex-snapshot
On Computing the Distinguishing Numbers of Trees and Forests
inferredcites →https://doi.org/10.37236/1984openalex-snapshot
Distinguishing Cartesian Powers of Graphs
inferredcites →https://doi.org/10.37236/947openalex-snapshot
Distinguishability of Locally Finite Trees
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.22496openalex-snapshot
The optimal general upper bound for the distinguishing index of infinite graphs
inferred← citeshttps://doi.org/10.1002/jgt.22704openalex-snapshot
Distinguishing orthogonality graphs
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-030-77983-2_5openalex-snapshot
Symmetry Parameters for Mycielskian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08019-2_32openalex-snapshot
On the Effectiveness of Symmetry Breaking
inferred← citeshttps://doi.org/10.1007/s00493-015-3071-5openalex-snapshot
Distinguishing graphs with intermediate growth
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/s10801-014-0529-2openalex-snapshot
Infinite motion and 2-distinguishability of graphs and groups
inferred← citeshttps://doi.org/10.1007/s13226-021-00004-zopenalex-snapshot
Equitable distinguishing chromatic number
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.2018.10.021openalex-snapshot
On the distinguishing number of cyclic tournaments: Towards the Albertson–Collins Conjecture
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.2020.111984openalex-snapshot
Number of distinguishing colorings and partitions
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112512openalex-snapshot
The cost of 2-distinguishing hypercubes
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.03.020openalex-snapshot
On the growth of cocompact hyperbolic Coxeter groups
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.2017.10.003openalex-snapshot
Bijections for Weyl Chamber walks ending on an axis, using arc diagrams and Schnyder woods
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.endm.2008.06.010openalex-snapshot
A bijection for covered maps on orientable surfaces
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.016openalex-snapshot
Counting coloured planar maps
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2021.10.033openalex-snapshot
Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's Conjecture confirmed
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.06.001openalex-snapshot
Breaking graph symmetries by edge colourings
inferred← citeshttps://doi.org/10.1017/9781316576571.005openalex-snapshot
The Cost of Distinguishing Graphs
inferred← citeshttps://doi.org/10.1017/s0963548313000382openalex-snapshot
Random Colourings and Automorphism Breaking in Locally Finite Graphs
inferred← citeshttps://doi.org/10.1112/blms.12824openalex-snapshot
Asymmetric colouring of locally compact permutation groups
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/s1995080221040053openalex-snapshot
A Note on Computable Distinguishing Colorings
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.2878.a61openalex-snapshot
On asymmetric colourings of graphs with bounded degrees and infinite motion
inferred← citeshttps://doi.org/10.26493/1855-3974.334.fe4openalex-snapshot
Distinguishing graphs with infinite motion and nonlinear growth
inferred← citeshttps://doi.org/10.26493/1855-3974.3453.4a8openalex-snapshot
Brooks' type theorems for coloring parameters of locally finite graphs and Kőnig's Lemma
inferred← citeshttps://doi.org/10.26493/1855-3974.792.403openalex-snapshot
The distinguishing index of the Cartesian product of countable graphs
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.1504.f7aopenalex-snapshot
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
inferred← citeshttps://doi.org/10.37236/2117openalex-snapshot
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/2283openalex-snapshot
Distinguishability of Infinite Groups and Graphs
inferred← citeshttps://doi.org/10.37236/292openalex-snapshot
Distinguishing Number of Countable Homogeneous Relational Structures
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/3933openalex-snapshot
The Distinguishing Index of Infinite Graphs
inferred← citeshttps://doi.org/10.37236/4873openalex-snapshot
Local Finiteness, Distinguishing Numbers, and Tucker's Conjecture
inferred← citeshttps://doi.org/10.37236/7281openalex-snapshot
Distinguishing Graphs of Maximum Valence 3
inferred← citeshttps://doi.org/10.37236/8370openalex-snapshot
Distinguishing Number of Universal Homogeneous Urysohn Metric Spaces
inferred← citeshttps://doi.org/10.37236/8886openalex-snapshot
On Asymmetric Colourings of Claw-Free Graphs
inferred← citeshttps://doi.org/10.4310/joc.2010.v1.n2.a4openalex-snapshot
Distinguishing number and adjacency properties
inferred← citeshttps://doi.org/10.48550/arxiv.1406.7870openalex-snapshot
Multicoloured Random Graphs: Constructions and Symmetry
inferred← citeshttps://doi.org/10.48550/arxiv.1811.06023openalex-snapshot
Distinguishing number of Urysohn metric spaces
inferred← citeshttps://doi.org/10.48550/arxiv.2006.03739openalex-snapshot
Distinguishing Generalized Mycielskian Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1902openalex-snapshot
Distinguishing Cartesian products of countable 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.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.