Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
On the k-path cover problem for cacti
Theoretical Computer Science
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Jump number maximization for proper interval graphs and series-parallel graphs
Information Sciences: an International Journal
Path covering number and L(2,1)-labeling number of graphs
Discrete Applied Mathematics
| Hi-index | 5.23 |