Spanning caterpillar in biconvex bipartite graphs
Document Type
Article
Publication Title
Discrete Applied Mathematics
Abstract
A bipartite graph G=(A,B,E) is said to be a biconvex bipartite graph if there exist orderings
First Page
32
Last Page
36
DOI
10.1016/j.dam.2024.05.016
Publication Date
10-30-2024
Recommended Citation
Antony, Dhanyamol; Das, Anita; Gosavi, Shirish; and Jacob, Dalu, "Spanning caterpillar in biconvex bipartite graphs" (2024). Open Access archive. 9925.
https://impressions.manipal.edu/open-access-archive/9925
COinS