On \(P_{\geq 3}\)-factor deleted graphs (Q2115230)
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: On P_ 3-factor deleted graphs |
scientific article; zbMATH DE number 7490427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(P_{\geq 3}\)-factor deleted graphs |
scientific article; zbMATH DE number 7490427 |
Statements
On \(P_{\geq 3}\)-factor deleted graphs (English)
0 references
15 March 2022
0 references
toughness
0 references
isolated toughness
0 references
connectivity
0 references
\(P_{\geq 3}\)-factor
0 references
\(P_{\geq 3}\)-factor deleted graph
0 references
0 references
0 references
0.909731149673462
0 references
0.9042896032333374
0 references
0.8781567215919495
0 references
0.8759872913360596
0 references
0.8678348064422607
0 references
