Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095)
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: Enumeration and maximum number of minimal connected vertex covers in graphs |
scientific article; zbMATH DE number 6806768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration and maximum number of minimal connected vertex covers in graphs |
scientific article; zbMATH DE number 6806768 |
Statements
Enumeration and maximum number of minimal connected vertex covers in graphs (English)
0 references
14 November 2017
0 references
chordal graphs
0 references
distance-hereditary graphs
0 references
0 references
0.995453417301178
0 references
0.8037001490592957
0 references
0.8010497689247131
0 references
0.7995517253875732
0 references
0.7992254495620728
0 references
