Atlas home || Conferences | Abstracts | about Atlas

25th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing
December 4-8, 2000
University of Canterbury
Christchurch, New Zealand

Organizers
Charles Semple, Mike Steel

View Abstracts
Conference Homepage

Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
by
Jozef Širáň
Slovak University of Technology, Bratislava, Slovakia
Coauthors: Sangho Shim, Pohang University of Science and Technology, Korea, Janez Zerovnik, University of Maribor, Slovenia

In the talk we disprove the uniform shortest path routing conjecture for vertex-transitive graphs by constructing an infinite family of counterexamples.

Date received: October 2, 2000


Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafn-12.