Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,418,351 papers from all fields of science
Search
Sign In
Create Free Account
Distinguishing coloring
Known as:
Distinguishing number
In graph theory, a distinguishing coloring or distinguishing labeling of a graph is an assignment of colors or labels to the vertices of the graph…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Arthur–Merlin protocol
Complement graph
Frucht graph
Frucht's theorem
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Distinguishing Numbers and Generalizations.
Caleb Ji
2018
Corpus ID: 102350536
The distinguishing number of a graph was introduced by Albertson and Collins as a measure of the amount of symmetry contained in…
Expand
2018
2018
Distinguishing number of Urysohn metric spaces
A. Bonato
,
C. Laflamme
,
M. Pawliuk
,
N. Sauer
2018
Corpus ID: 119667284
The distinguishing number of a structure is the smallest size of a partition of its elements so that only the trivial…
Expand
2018
2018
A ug 2 01 8 Distinguishing Numbers and Generalizations
Caleb Ji
2018
Corpus ID: 52493128
The distinguishing number of a graph was introduced by Albertson and Collins in [1] as a measure of the amount of symmetry…
Expand
2016
2016
Mathématiques de la Décision Distinguishing Number of some Circulant Graphs
Sylvain Gravier
,
Kahina Meslem
,
Souad Slimani
2016
Corpus ID: 7962382
Introduced by Albertson and al. [1], the distinguishing number D(G) of a graph G is the least integer r such that there is a r…
Expand
2015
2015
A typological view of possessive constructions in Sign Language of the Netherlands
Cornelia Loos
2015
Corpus ID: 9256490
ones (6b), as well as for kinship terms (6c, 6d) and part-whole relations with animate (6e) and inanimate possessors (6f…
Expand
2014
2014
Symmetry breaking of graphs and groups
Florian Lehner
2014
Corpus ID: 53460916
This thesis is concerned with open conjectures in graph theory which revolve around colourings of graphs, colour preserving…
Expand
2013
2013
Bounding the distinguishing number of infinite graphs
Simon M. Smith
,
M. Watkins
2013
Corpus ID: 119586763
A group of permutations G of a set V is k-distinguishable if there exists a partition of V into k parts such that only the…
Expand
2004
2004
Design of Distinguishing Number if the Same Kind of Books
Liu Xiu
2004
Corpus ID: 64196274
This paper introduces the design principle and usage state of distinguishing number if the same kind of book at the present time…
Expand
1998
1998
Local Distinguishing Numbers of Trees
Christine T. Cheng
1998
Corpus ID: 16903938
The i-local distinguishing number of G, denoted by LD i (G), was deened in 3]. Let T be a tree on n > 2 vertices with maximum…
Expand
1996
1996
An introduction to symmetry breaking in graphs
M. Albertson
,
Karen L. Collins
1996
Corpus ID: 117059505
A process for regenerating an ammonium, heavy metal salts, ammonium nitrate and organic substances containing wash water…
Expand