Subhamiltonian graph

In graph theory and graph drawing, a subhamiltonian graph is a subgraph of a planar Hamiltonian graph.[1][2]

  1. ^ Heath, Lenwood S. (1987), "Embedding outerplanar graphs in small books", SIAM Journal on Algebraic and Discrete Methods, 8 (2): 198–218, doi:10.1137/0608018, MR 0881181.
  2. ^ Di Giacomo, Emilio; Liotta, Giuseppe (2010), "The Hamiltonian augmentation problem and its applications to graph drawing", WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010, Proceedings, Lecture Notes in Computer Science, vol. 5942, Berlin: Springer, pp. 35–46, doi:10.1007/978-3-642-11440-3_4, MR 2749626.