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 11 items.
- Maximum nullity of outerplanar graphs and the path cover number (Q848586) (← links)
- Path coverings of graphs and height characteristics of matrices (Q1322029) (← links)
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (Q1627174) (← links)
- An optimal path cover algorithm for cographs (Q1903198) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- 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)
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← 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)