Graph distinguishing numbers constitute a vital parameter in understanding the symmetry properties of graphs. Fundamentally, the distinguishing number of a graph is the minimal number of labels ...
Small separations in symmetric graphs (with B. Mohar) in preparation. Symmetric graphs with no K_n minor (with B. Mohar) in preparation Evolutionarily distinct species capture more phylogenetic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results