On the public citation graph
Symmetry Breaking in Graphs
0 signed · 254 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/3-540-11493-9openalex-snapshot
Group-Theoretic Algorithms and Graph Isomorphism
inferredcites →https://doi.org/10.1007/978-1-4612-0333-9openalex-snapshot
The Graph Isomorphism Problem
inferredcites →https://doi.org/10.1007/978-1-4612-4176-8openalex-snapshot
An Introduction to the Theory of Groups
inferredcites →https://doi.org/10.1007/978-3-662-21946-1openalex-snapshot
Generators and Relations for Discrete Groups
inferredcites →https://doi.org/10.1007/978-3-662-25739-5openalex-snapshot
Generators and Relations for Discrete Groups
inferredcites →https://doi.org/10.1016/0012-365x(73)90138-6openalex-snapshot
Tough graphs and hamiltonian circuits
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7063-xopenalex-snapshot
Graphs, Groups and Surfaces
inferredcites →https://doi.org/10.1017/cbo9780511600739openalex-snapshot
Permutation Groups and Combinatorial Structures
inferredcites →https://doi.org/10.1112/blms/12.2.156bopenalex-snapshot
PERMUTATION GROUPS AND COMBINATORIAL STRUCTURES
inferredcites →https://doi.org/10.4153/cjm-1949-033-6openalex-snapshot
Graphs of Degree Three with a Given Abstract Group
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.20190openalex-snapshot
Distinguishing Cartesian powers of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20368openalex-snapshot
The determining number of a Cartesian product
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.1002/jgt.23013openalex-snapshot
The distinguishing index of graphs with infinite minimum degree
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-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/978-3-030-77983-2_5openalex-snapshot
Symmetry Parameters for Mycielskian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_29openalex-snapshot
Labeling Schemes for Deterministic Radio Multi-broadcast
inferred← citeshttps://doi.org/10.1007/978-3-032-24850-3_4openalex-snapshot
On the Distinguishing Coloring of Some Graphs
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/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/978-3-642-16023-3_44openalex-snapshot
Storage Capacity of Labeled Graphs
inferred← citeshttps://doi.org/10.1007/978-981-10-1651-6_20openalex-snapshot
Labeling of Sets Under the Actions of $$\overrightarrow{{S}_{n}} $$ and $$\overrightarrow{{A}_{n}}$$
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-010-0929-6openalex-snapshot
Rigidity and Separation Indices of Graphs in Surfaces
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-1540-7openalex-snapshot
Fixing Numbers for Matroids
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/s00493-011-2221-7openalex-snapshot
Distinguishing labeling of the actions of almost simple groups
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-006-0006-7openalex-snapshot
The distinguishing number of the direct product and wreath product action
inferred← citeshttps://doi.org/10.1007/s10801-011-0313-5openalex-snapshot
Orbit equivalence and permutation groups defined by unordered relations
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/s11083-021-09583-2openalex-snapshot
The Distinguishing Number and Distinguishing Chromatic Number for Posets
inferred← citeshttps://doi.org/10.1007/s11565-018-0297-3openalex-snapshot
Pairings and related symmetry notions
inferred← citeshttps://doi.org/10.1007/s12190-025-02430-2openalex-snapshot
Symmetry-based granulation in networks associated with commutative rings: application in social network dynamics
inferred← citeshttps://doi.org/10.1007/s13226-021-00004-zopenalex-snapshot
Equitable distinguishing chromatic number
inferred← citeshttps://doi.org/10.1007/s13226-022-00314-wopenalex-snapshot
On distinguishing labelling of sets under the wreath product action
inferred← citeshttps://doi.org/10.1007/s40314-023-02571-9openalex-snapshot
Communicability cosine distance: similarity and symmetry in graphs/networks
inferred← citeshttps://doi.org/10.1007/s40995-022-01379-2openalex-snapshot
Distinguishing Threshold for Some Graph Operations
inferred← citeshttps://doi.org/10.1016/j.aim.2018.04.009openalex-snapshot
A proof of Pyber's base size conjecture
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.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.2015.12.005openalex-snapshot
A note on adjacent vertex distinguishing colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.07.034openalex-snapshot
A note on breaking small automorphisms in graphs
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.dam.2018.10.021openalex-snapshot
On the distinguishing number of cyclic tournaments: Towards the Albertson–Collins Conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.023openalex-snapshot
Asymmetric colorings of products of graphs and digraphs
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.2003.11.018openalex-snapshot
The distinguishing number of the hypercube
inferred← citeshttps://doi.org/10.1016/j.disc.2006.06.004openalex-snapshot
Destroying automorphisms by fixing nodes
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.2007.04.048openalex-snapshot
Extremal problems on detectable colorings of trees
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.070openalex-snapshot
Distinguishing colorings of Cartesian products of complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.02.022openalex-snapshot
Distinguishing labeling of group actions
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.2011.10.023openalex-snapshot
The distinguishing numbers of graphs on closed surfaces
inferred← citeshttps://doi.org/10.1016/j.disc.2017.05.008openalex-snapshot
Graphs and their associated inverse semigroups
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.2019.03.001openalex-snapshot
List-distinguishing Cartesian products of cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111959openalex-snapshot
On symmetries of edge and vertex colourings of 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.disc.2025.114492openalex-snapshot
Tyshkevich's graph decomposition and the distinguishing numbers of unigraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.07.001openalex-snapshot
Cartesian powers of graphs can be distinguished by two labels
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.ejc.2019.103034openalex-snapshot
Distinguishing index of maps
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103145openalex-snapshot
A bound for the distinguishing index of regular graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103414openalex-snapshot
Distinguishing index of graphs with simple automorphism groups
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103526openalex-snapshot
Asymmetric edge-colorings of graphs with three colors
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.095openalex-snapshot
Symmetry Breaking in Tournaments
inferred← citeshttps://doi.org/10.1016/j.heliyon.2023.e19820openalex-snapshot
Symmetries and symmetry-breaking in arithmetic graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2013.11.004openalex-snapshot
Effective storage capacity of labeled graphs
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.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.1016/j.tcs.2017.02.032openalex-snapshot
Edge motion and the distinguishing index
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.004openalex-snapshot
Precise bounds for the distinguishing index of the Cartesian product
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00167-8openalex-snapshot
On the local distinguishing numbers of cycles
inferred← citeshttps://doi.org/10.1017/9781316576571.005openalex-snapshot
The Cost of Distinguishing Graphs
inferred← citeshttps://doi.org/10.1017/etds.2021.89openalex-snapshot
Reconstructing a minimal topological dynamical system from a set of return times
inferred← citeshttps://doi.org/10.1017/s0963548313000382openalex-snapshot
Random Colourings and Automorphism Breaking in Locally Finite Graphs
inferred← citeshttps://doi.org/10.1063/5.0199429openalex-snapshot
Automorphism groups and distinguishing numbers of some graphs related to cycle graph
inferred← citeshttps://doi.org/10.1080/00927872.2018.1469031openalex-snapshot
Stabilizing the distinguishing number of a graph
inferred← citeshttps://doi.org/10.1080/02522667.2017.1294304openalex-snapshot
Distinguishing number and distinguishing index of some operations on graphs
inferred← citeshttps://doi.org/10.1080/02522667.2020.1773614openalex-snapshot
Distinguishing critical graphs
inferred← citeshttps://doi.org/10.1080/02522667.2021.2003011openalex-snapshot
The distinguishing number of groups based on the distinguishing number of subgroups
inferred← citeshttps://doi.org/10.1080/03081087.2025.2558597openalex-snapshot
Automorphism group and related parameters of nonzero component union graph over a vector space
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.1088/1742-6596/1724/1/012026openalex-snapshot
Distance-2 Irregular chromatic numbers for some graphs
inferred← citeshttps://doi.org/10.1109/icci-cc.2014.6921456openalex-snapshot
The grounding of computational psychoanalysis: A comparative history of culture overview of Matte Blanco bilogic
inferred← citeshttps://doi.org/10.1109/itsc.2007.4357816openalex-snapshot
Marker-Based Localizing for Indoor Navigation
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/s0081543807050070openalex-snapshot
Sets with trivial global stabilizers for primitive permutation groups which are not almost simple
inferred← citeshttps://doi.org/10.1134/s0081543808050106openalex-snapshot
On primitive permutation groups with nontrivial global stabilizers
inferred← citeshttps://doi.org/10.1134/s1990478921010014openalex-snapshot
The Distinguishing Numbers and the Distinguishing Indexes of Cayley Graphs
inferred← citeshttps://doi.org/10.1134/s1995080221040053openalex-snapshot
A Note on Computable Distinguishing Colorings
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.1142/s1793830919500083openalex-snapshot
Symmetry breaking in planar and maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1177/026142940502000211openalex-snapshot
‘Good Research’ Conducted by Talented High School Students: The Case of Sci-Tech
inferred← citeshttps://doi.org/10.12988/ija.2015.5851openalex-snapshot
Distinguishing labelling of partial actions
inferred← citeshttps://doi.org/10.18690/978-961-286-113-1.11openalex-snapshot
Breaking graph symmetries by edge colourings
inferred← citeshttps://doi.org/10.18690/978-961-286-113-1.8openalex-snapshot
Distinguishing graphs of maximum valence 3
inferred← citeshttps://doi.org/10.22052/ijmc.2019.152413.1400openalex-snapshot
The distinguishing number and the distinguishing index of graphs from primary subgraphs
inferred← citeshttps://doi.org/10.2298/fil1714393aopenalex-snapshot
Distinguishing number and distinguishing index of certain graphs
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.1015.84fopenalex-snapshot
Game distinguishing numbers of Cartesian products
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.192.531openalex-snapshot
Motion and distinguishing number two
inferred← citeshttps://doi.org/10.26493/1855-3974.195.d00openalex-snapshot
Distinguishing partitions and asymmetric uniform hypergraphs
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.245.348openalex-snapshot
Distinguishing numbers of Cartesian products of multiple complete graphs
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.31.d93openalex-snapshot
Small label classes in 2-distinguishing labelings
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.428.296openalex-snapshot
Distinguishing partitions of complete multipartite graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.751.9a8openalex-snapshot
Distinguishing graphs by total colourings
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/1855-3974.848.669openalex-snapshot
χ_D(G), |Aut(G)|, and a variant of the motion lemma
inferred← citeshttps://doi.org/10.26493/1855-3974.909.0e1openalex-snapshot
The distinguishing index of the Cartesian product of finite graphs
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.1395.a37openalex-snapshot
Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density
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.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.26637/mjm1101/007openalex-snapshot
On distinguishing labelling of groups for the conjugation action
inferred← citeshttps://doi.org/10.2989/16073606.2023.2274580openalex-snapshot
The number of distinguishing colorings of a Cartesian product graph
inferred← citeshttps://doi.org/10.2991/acsr.k.220202.005openalex-snapshot
Distinguishing Number of the Generalized Theta Graph
inferred← citeshttps://doi.org/10.3390/math11061322openalex-snapshot
Fixing Numbers of Point-Block Incidence Graphs
inferred← citeshttps://doi.org/10.3390/math7111111openalex-snapshot
Removing Twins in Graphs to Break Symmetries
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.3390/sym17101675openalex-snapshot
Probabilistic Measure of Symmetry Stability
inferred← citeshttps://doi.org/10.37236/1037openalex-snapshot
On Computing the Distinguishing Numbers of Trees and Forests
inferred← citeshttps://doi.org/10.37236/1096openalex-snapshot
The Maximum Distinguishing Number of a Group
inferred← citeshttps://doi.org/10.37236/1361openalex-snapshot
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
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/1816openalex-snapshot
Distinguishing Numbers for Graphs and Groups
inferred← citeshttps://doi.org/10.37236/1984openalex-snapshot
Distinguishing Cartesian Powers of Graphs
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/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/3223openalex-snapshot
The Cost of 2-Distinguishing Cartesian Powers
inferred← citeshttps://doi.org/10.37236/335openalex-snapshot
On the Determining Number and the Metric Dimension of Graphs
inferred← citeshttps://doi.org/10.37236/3933openalex-snapshot
The Distinguishing Index of Infinite Graphs
inferred← citeshttps://doi.org/10.37236/4263openalex-snapshot
Infinite Graphs with Finite 2-Distinguishing Cost
inferred← citeshttps://doi.org/10.37236/4873openalex-snapshot
Local Finiteness, Distinguishing Numbers, and Tucker's Conjecture
inferred← citeshttps://doi.org/10.37236/6openalex-snapshot
Finite Factors of Bernoulli Schemes and Distinguishing Labelings of Directed Graphs
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.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.3934/math.20261097openalex-snapshot
On the region $ \pi $ chromatic number of snake graph families
inferred← citeshttps://doi.org/10.4018/978-1-5225-4128-8.ch004openalex-snapshot
First Attempts to Formalize Some Main Aspects of Psychoanalysis
inferred← citeshttps://doi.org/10.4018/978-1-5225-4128-8.ch006openalex-snapshot
The Role of Unconscious Constructs in Logic and Their Applications to Informatics
inferred← citeshttps://doi.org/10.4018/ijcini.2014100104openalex-snapshot
The Dawning of Computational Psychoanalysis
inferred← citeshttps://doi.org/10.4134/bkms.2015.52.2.395openalex-snapshot
THE DISTINGUISHING NUMBERS OF MERGED JOHNSON 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.0806.2078openalex-snapshot
Distinguishing Primitive Permutation Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1111.3252openalex-snapshot
Hypergraphs for computing determining sets of Kneser graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1111.4989openalex-snapshot
List Distinguishing Parameters of Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0393openalex-snapshot
Distinguishing graphs with intermediate growth
inferred← citeshttps://doi.org/10.48550/arxiv.1301.4583openalex-snapshot
Distinguishing partitions of complete multipartite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6642openalex-snapshot
Random colorings and automorphism breaking in locally finite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0416openalex-snapshot
Distinguishing homomorphisms of infinite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4372openalex-snapshot
Distinguishing graphs with infinite motion and nonlinear growth
inferred← citeshttps://doi.org/10.48550/arxiv.1406.3844openalex-snapshot
Distinguishing Number for some Circulant Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1406.7870openalex-snapshot
Multicoloured Random Graphs: Constructions and Symmetry
inferred← citeshttps://doi.org/10.48550/arxiv.1408.5849openalex-snapshot
Distinguishing extension numbers for $\mathbf R^n$ and $S^n$
showing the first 200 of 240 · page through all 240
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.