Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts (Q6947249)
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 8075779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts |
scientific article; zbMATH DE number 8075779 |
Statements
Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts (English)
0 references
5 August 2025
0 references
