The classification of connected-homogeneous digraphs with more than one end-Reference-Cited by-同舟云学术

The classification of connected-homogeneous digraphs with more than one end

Published:2012-06-29 Issue:1 Volume:365 Page:531-553
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Hamann Matthias,Hundertmark Fabian

Abstract

We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/2013-365-01/S0002-9947-2012-05666-2/S0002-9947-2012-05666-2.pdf

Reference31 articles.

1. Infinite highly arc transitive digraphs and universal covering digraphs;Cameron, Peter J.;Combinatorica,1993

2. Homogeneous tournaments revisited;Cherlin, Gregory;Geom. Dedicata,1988

3. The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments;Cherlin, Gregory L.;Mem. Amer. Math. Soc.,1998

4. Cambridge Studies in Advanced Mathematics;Dicks, Warren,1989

5. Graduate Texts in Mathematics;Diestel, Reinhard,2010

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Local 2-separators;Journal of Combinatorial Theory, Series B;2022-09

2. On tree-decompositions of one-ended graphs;Mathematische Nachrichten;2018-10-11

3. The classification of finite and locally finite connected-homogeneous digraphs;Combinatorica;2016-06-17

4. Vertex Cuts;Journal of Graph Theory;2014-12-08

5. Connected-Homomorphism-Homogeneous Graphs;Journal of Graph Theory;2014-02-27