A note on the asymptotic and computational complexity of graph distinguishability.

Russell, Alexander; Sundaram, Ravi

Displaying similar documents to “A note on the asymptotic and computational complexity of graph distinguishability.”

Bounds on the distinguishing chromatic number.

Collins, Karen L., Hovey, Mark, Trenk, Ann N. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Ramsey theory applications.

Rosta, Vera (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Balanced online Ramsey games in random graphs.

Prakash, Anupam, Spöhel, Reto, Thomas, Henning (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.

Schauz, Uwe (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Identifying graph automorphisms using determining sets.

Boutin, Debra L. (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Mr. Paint and Mrs. Correct.

Schauz, Uwe (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the graphs of Hoffman-Singleton and Higman-Sims.

Hafner, Paul R. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Note: The Smallest Nonevasive Graph Property

Michał Adamaszek (2014)

Discussiones Mathematicae Graph Theory

Similarity:

A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n = 6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs...