Forbidden triples generating a finite set of graphs with high connectivity (Q5207934)
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: Forbidden triples generating a finite set of graphs with high connectivity |
scientific article; zbMATH DE number 7150799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Forbidden triples generating a finite set of graphs with high connectivity |
scientific article; zbMATH DE number 7150799 |
Statements
FORBIDDEN TRIPLES GENERATING A FINITE SET OF GRAPHS WITH HIGH CONNECTIVITY (English)
0 references
14 January 2020
0 references
forbidden subgraph
0 references
forbidden triple
0 references
\(k\)-connected graph
0 references
0 references
0 references
0.9450926780700684
0 references
0.939804196357727
0 references
0.8943198323249817
0 references
0.8940211534500122
0 references
0.8459993004798889
0 references
