The classification of finite and locally finite connected-homogeneous digraphs

2011/01/12 by Matthias Hamann, Hamann, Matthias · 2 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1101.2330

24 pages, 5 figures

arxiv created 2011/01/12 · openalex publication_date 2011/01/12 · arxiv updated 2011/01/13 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28

Abstract

We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.

Citations

• A classification of connected-homogeneous digraphs

Cited by

• Infinite induced-saturated graphs
• Connected-homomorphism-homogeneous graphs

Related

• Countable connected-homogeneous digraphs
• Locally-finite connected-homogeneous digraphs
• A classification of connected-homogeneous digraphs
• Set-homogeneous directed graphs
• Homogeneous 2-partite digraphs