A min-max theorem for plane bipartite graphs (Q968154)
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: A min-max theorem for plane bipartite graphs |
scientific article; zbMATH DE number 5703740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A min-max theorem for plane bipartite graphs |
scientific article; zbMATH DE number 5703740 |
Statements
A min-max theorem for plane bipartite graphs (English)
0 references
5 May 2010
0 references
plane bipartite graphs
0 references
clar number
0 references
combinatorial dual
0 references
network flows
0 references
0.9498999
0 references
0.94660735
0 references
0.91564596
0 references
0.9035305
0 references
0.9031288
0 references
0.9021961
0 references
0.89345866
0 references
0.89345866
0 references
