In topological graph theory, a 1-planar graph is a graph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing...
24 KB (2,757 words) - 12:14, 12 August 2024
hypotraceable graphs", Discrete Mathematics, 14 (4): 377–389, doi:10.1016/0012-365x(76)90071-6, MR 0422086 Hatzel, Wolfgang (1979), "Ein planarer hypohamiltonscher...
6 KB (514 words) - 07:03, 6 December 2023
650–658, doi:10.1016/j.disc.2006.07.013. Hatzel, W. (1979), "Ein planarer hypohamiltonscher Graph mit 57 Knoten", Math. Ann., 243 (3): 213–216, doi:10.1007/BF01424541...
24 KB (2,469 words) - 20:50, 29 August 2024