Given a graph G with a terminal set R ⊆ V(G), the Steiner tree
problem (...
The class of k-star caterpillar convex bipartite graphs generalizes the
...
A bipartite graph is chordal bipartite if every cycle of length at least...
In this paper, we investigate Hamiltonian path problem in the context of...
A bipartite graph is chordal bipartite if every cycle of length at least...