On relating edges in graphs without cycles of length 4 (Q2447533)
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 6289273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On relating edges in graphs without cycles of length 4 |
scientific article; zbMATH DE number 6289273 |
Statements
On relating edges in graphs without cycles of length 4 (English)
0 references
28 April 2014
0 references
well-covered graph
0 references
relating edge
0 references
Ford and Fulkerson algorithm
0 references
SAT problem
0 references
0.7922375798225403
0 references
0.7759803533554077
0 references
0.7323837280273438
0 references
0.7240932583808899
0 references
