Recognizing near-bipartite Pfaffian graphs in polynomial time (Q987672)
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: Recognizing near-bipartite Pfaffian graphs in polynomial time |
scientific article; zbMATH DE number 5770502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing near-bipartite Pfaffian graphs in polynomial time |
scientific article; zbMATH DE number 5770502 |
Statements
Recognizing near-bipartite Pfaffian graphs in polynomial time (English)
0 references
13 August 2010
0 references
Pfaffian graphs
0 references
matching covered graphs
0 references
perfect matching
0 references
0.9265984892845154
0 references
0.86082923412323
0 references
0.8492236733436584
0 references
0.8345361948013306
0 references
0.8345361948013306
0 references
