Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893)
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: Maximum max-k-clique subgraphs in cactus subtree graphs |
scientific article; zbMATH DE number 7713068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum max-k-clique subgraphs in cactus subtree graphs |
scientific article; zbMATH DE number 7713068 |
Statements
Maximum max-k-clique subgraphs in cactus subtree graphs (English)
0 references
15 July 2023
0 references
cactus subtree graph
0 references
maximum max-\(k\)-clique subgraph
0 references
maximum induced bipartite graph
0 references
maximum induced forest
0 references
minimum feedback vertex set
0 references
0 references
0.7748027443885803
0 references
0.7685117721557617
0 references
0.7663977742195129
0 references
0.7593564391136169
0 references
