Deformation and rigidity of simplicial group actions on trees.
Destroying symmetry by orienting edges: complete graphs and complete bigraphs
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which can be oriented so that the resulting mixed graph has the trivial automorphism group. We find that this number for complete graphs is related to the number of identity oriented trees. For complete bipartite graphs , s ≤ t, this number does not always exist. We determine for s ≤ 4 the values of t for which this number does exist.
Determination of all rigid groups of order not exceeding 60
Die Struktur der automorphismen spezieller, endlicher, ebener, dreifach-knotenzusammenhängender graphen
Die Zusammenhangsstruktur symmetrischer Graphen.
Direct products of cyclic semigroups admitting a planar Cayley graph.
Distinguishing Cartesian powers of graphs.
Distinguishing Cartesian Products of Countable Graphs
The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism. In this paper we improve results about the distinguishing number of Cartesian products of finite and infinite graphs by removing restrictions to prime or relatively prime factors.
Distinguishing chromatic numbers of bipartite graphs.
Distinguishing infinite graphs.
Distinguishing numbers for graphs and groups.
Double coverings and reflexive abelian hypermaps.
Doubly Primitive Vertex Stabilisers in Graphs.
Dynamic cage survey.