The Wiener–Araya graph is, in graph theory, a graph on 42 vertices with 67 edges. It is hypohamiltonian, which means that it does not itself have a Hamiltonian...
6 KB (514 words) - 07:03, 6 December 2023
Tutte's fragment Tutte graph Young–Fibonacci graph Wagner graph Wells graph Wiener–Araya graph Windmill graph The strongly regular graph on v vertices and...
14 KB (1,247 words) - 18:21, 11 May 2025
various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...
7 KB (85 words) - 19:28, 12 March 2024
Earlier small planar hypohamiltonian graphs with 42, 57 and 48 vertices, respectively, were found by Wiener & Araya (2009), Hatzel (1979) and Zamfirescu...
24 KB (2,469 words) - 17:30, 13 May 2025
Grinberg's theorem (category Theorems in graph theory)
hypotraceable graphs", Journal of Combinatorial Theory, Series B, 30 (1): 36–44, doi:10.1016/0095-8956(81)90089-7, MR 0609592 Wiener, Gábor; Araya, Makoto (2009)...
9 KB (1,161 words) - 22:39, 27 February 2025