Hamiltonian cycles and Hamiltonian-biconnectedness in bipartite digraphs.
Hamiltonian virus-free digraphs.
Hardness Results for Total Rainbow Connection of Graphs
A total-colored path is total rainbow if both its edges and internal vertices have distinct colors. The total rainbow connection number of a connected graph G, denoted by trc(G), is the smallest number of colors that are needed in a total-coloring of G in order to make G total rainbow connected, that is, any two vertices of G are connected by a total rainbow path. In this paper, we study the computational complexity of total rainbow connection of graphs. We show that deciding whether a given total-coloring...
Harmonic functions on annuli of graphs
Homogeneous digraphs