On partitioning simple bipartite graphs in vertex-disjoint paths (Q925494)
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: On partitioning simple bipartite graphs in vertex-disjoint paths |
scientific article; zbMATH DE number 5283158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On partitioning simple bipartite graphs in vertex-disjoint paths |
scientific article; zbMATH DE number 5283158 |
Statements
On partitioning simple bipartite graphs in vertex-disjoint paths (English)
0 references
3 June 2008
0 references
bipartite graphs
0 references
neighborhood unions
0 references
vertex-disjoint paths
0 references
0.95475364
0 references
0.95052195
0 references
0.93833333
0 references
0 references
0 references
0.91309774
0 references
0 references
0.9124685
0 references
0.91196644
0 references
