Alspach, B.; Marušič, Dragan; and Nowitz, L. (1994), "Constructing Graphs which are 1/2-Transitive." J. Austral. Math. Soc.56, 391-402, 1994.Bouwer, Z. "Vertex and Edge Transitive, But Not 1-Transitive Graphs." Canad. Math. Bull.13, 231-237, 1970.Doyle, P. G. On Transitive Graphs. Senior Thesis. Cambridge, MA, Harvard College, April 1976.Doyle, P. "A 27-Vertex Graph That Is Vertex-Transitive and Edge-Transitive But Not L-Transitive." October 1998. http://arxiv.org/abs/math/0703861.Godsil, C. and Royle, G. Algebraic Graph Theory. New York: Springer-Verlag, p. 37, 2001.Holt, D. F. "A Graph Which Is Edge Transitive But Not Arc Transitive." J. Graph Th.5, 201-204, 1981.Marušič, D.; Pisanski, T.; and Wilson, S. "The Genus of the Gray Graph is 7." Europ. J. Combin.26, 377-385, 2005.Pisanski, T. and Randić, M. "Bridges between Geometry and Graph Theory." In Geometry at Work: A Collection of Papers Showing Applications of Geometry (Ed. C. A. Gorini). Washington, DC: Math. Assoc. Amer., pp. 174-194, 2000.Tan, J. "Of Christmas Lights: the Nine Colourings of the Holt Graph." Dec. 16, 2021. https://community.wolfram.com/groups/-/m/t/2426803.Tutte, W. T. Connectivity in Graphs. Toronto, CA: University of Toronto Press, 1966.
正則對稱弧非傳遞連通圖給出了構造性證明
。最小的此類鮑威爾圖有 54 個頂點，並且是四次圖。
-漢明圖的子圖。上面說明了幾個嵌入，其中第一個歸功於 Doyle (1998)，最後一個歸功於 Marušič等人 (2005)。
簡潔地描述和構造，其中
連線到
和 
(Holt 1981)。
, 
, 和 
是
的（實）根，按從小到大排序。
