Partition the vertices of a graph into one independent set and one acyclic set (Q2497500)
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 5043705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partition the vertices of a graph into one independent set and one acyclic set |
scientific article; zbMATH DE number 5043705 |
Statements
Partition the vertices of a graph into one independent set and one acyclic set (English)
0 references
4 August 2006
0 references
near-bipartition
0 references
acyclic set
0 references
independent set
0 references
0.7873850464820862
0 references
0.7724012732505798
0 references
0.7712633013725281
0 references
0.7692344188690186
0 references
