| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777588 | Journal of Combinatorial Theory, Series B | 2017 | 13 Pages |
Abstract
Confirming a conjecture of NeÅ¡etÅil, we show that up to isomorphism there are only finitely many finite minimal asymmetric undirected graphs. In fact, there are exactly 18 such graphs. We also show that these graphs are exactly the finite minimal involution-free graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Pascal Schweitzer, Patrick Schweitzer,