Partitioning a bipartite graph into vertex-disjoint paths. (Q5310215)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5194449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a bipartite graph into vertex-disjoint paths. |
scientific article; zbMATH DE number 5194449 |
Statements
21 September 2007
0 references
bipartite graphs
0 references
vertex-disjoint paths
0 references
Hamilton paths
0 references
0.9109449982643129
0 references
0.8673038482666016
0 references
0.8475999236106873
0 references
0.8444494605064392
0 references
0.8340953588485718
0 references
