An upper bound of a generalized upper Hamiltonian number of a graph

17 Mar 2020 Dzúrik Martin

In this article we study graphs with ordering of vertices, we define a generalization called a pseudoordering, and for a graph $H$ we define the $H$-Hamiltonian number of a graph $G$. We will show that this concept is a generalization of both the Hamiltonian number and the traceable number... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS