Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (Q1627174)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Covering a graph with nontrivial vertex-disjoint paths: existence and optimization |
scientific article; zbMATH DE number 6983009
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering a graph with nontrivial vertex-disjoint paths: existence and optimization |
scientific article; zbMATH DE number 6983009 |
Statements
Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (English)
0 references
22 November 2018
0 references
0.95196927
0 references
0.9276033
0 references
0.9201141
0 references
0.9138379
0 references
0.91300595
0 references
0.9101254
0 references
0.90853786
0 references
0.9064634
0 references
0 references
0.90226686
0 references
