On a Problem in Graph Theory
- 1 October 1963
- journal article
- Published by Cambridge University Press (CUP) in The Mathematical Gazette
- Vol. 47 (361) , 220-223
- https://doi.org/10.2307/3613396
Abstract
Suppose there are n towns every pair of which are connected by a single one-way road (roads meet only at towns). Is it possible to choose the direction of the traffic on all the roads so that if any two towns are named there is always a third from which the two named can be reached directly by road?Keywords
This publication has 0 references indexed in Scilit: