Characterizing and generalizing cycle completable graphs (Q6184532)
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: Characterizing and generalizing cycle completable graphs |
scientific article; zbMATH DE number 7794538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing and generalizing cycle completable graphs |
scientific article; zbMATH DE number 7794538 |
Statements
Characterizing and generalizing cycle completable graphs (English)
0 references
25 January 2024
0 references
cycle completable
0 references
forbidden induced subgraphs
0 references
\(k\)-quasichordal
0 references
0.8037537932395935
0 references
0.7482925653457642
0 references
0.7464333176612854
0 references
0.728731095790863
0 references
