On arc‐traceable tournaments
Copyright policy )On arc‐traceable tournaments
AbstractA digraph D = (V, A) is arc‐traceable if for each arc xy in A, xy lies on a directed path containing all the vertices of V, that is, a hamiltonian path. Given a tournament T, it is well known that it contains a directed hamiltonian path. In this article, we develop the structure necessary for a tournament T to contain an arc xy that is not on any hamiltonian path. Using this structure, we give sufficient conditions for a tournament to be arc‐traceable. In addition, we give examples to show that these conditions are best possible. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 157–166, 2006
- University of Colorado Denver United States
- California State University, San Marcos United States
Eulerian and Hamiltonian graphs, Hamiltonian path, Directed graphs (digraphs), tournaments, digraph
Eulerian and Hamiltonian graphs, Hamiltonian path, Directed graphs (digraphs), tournaments, digraph
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!