AbstractWe determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph Ks,t which admits only the identity automorphism. In particular, this allows us to determine the distinguishing number of the Cartesian product of complete graphs
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
AbstractWe determine the values of s and t for which there is a coloring of the edges of the complet...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
AbstractAn identity orientation of a graph G=(V,E) is an orientation of some of the edges of E such ...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
AbstractAn identity orientation of a graph G=(V,E) is an orientation of some of the edges of E such ...
If we want to distinguish all vertices of the graph by coloring its elements, then we have the follo...
If we want to distinguish all vertices of the graph by coloring its elements, then we have the follo...
We examine the distinguishing number of the Cartesian product of an arbitrary number of complete gra...
The distinguishing number of a graph G, denoted D(G), is the minimum number of colors needed to prod...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
AbstractWe determine the values of s and t for which there is a coloring of the edges of the complet...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
AbstractAn identity orientation of a graph G=(V,E) is an orientation of some of the edges of E such ...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
AbstractAn identity orientation of a graph G=(V,E) is an orientation of some of the edges of E such ...
If we want to distinguish all vertices of the graph by coloring its elements, then we have the follo...
If we want to distinguish all vertices of the graph by coloring its elements, then we have the follo...
We examine the distinguishing number of the Cartesian product of an arbitrary number of complete gra...
The distinguishing number of a graph G, denoted D(G), is the minimum number of colors needed to prod...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
DOI
Add to ORKG