Pages that link to "Item:Q2292153"
From MaRDI portal
The following pages link to Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153):
Displaying 5 items.
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Path cover problems with length cost (Q2154120) (← links)
- Path cover problems with length cost (Q6069927) (← links)
- Approximation algorithms for covering vertices by long paths (Q6586665) (← links)
- An approximation algorithm for covering vertices by \(4^+\)-paths (Q6606209) (← links)