2009/05/19 by Italo J. Dejter, Dejter, Italo J.
Computer Science · Mathematics · #05B25 #05C20 #05C62 #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #math.CO #msc:05B25 #msc:05C20 #msc:05C62
paper · pdf · doi:10.48550/arxiv.0905.3172
4 pages, 2 figures, 2 tables
openalex publication_date 2009/05/19 · arxiv created 2009/11/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The notion of a \mathcal C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs, and subsequently a strongly connected C4-ultrahomogeneous oriented graph on 168 vertices and 126 pairwise arc-disjoint 4-cycles is presented, with regular indegree and outdegree 3 and no circuits of lengths 2 and 3, by altering a definition of the Coxeter graph via pencils of ordered lines of the Fano plane in which pencils are replaced by ordered pencils.