Pages that link to "Item:Q1627174"
From MaRDI portal
The following pages link to Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (Q1627174):
Displaying 11 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (Q294361) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- An optimal path cover algorithm for cographs (Q1903198) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- Königsberg sightseeing: Eulerian walks in temporal graphs (Q2115887) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Eulerian walks in temporal graphs (Q2689257) (← links)
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← links)
