The existence of \(P_{\geq3}\)-factor covered graphs (Q2409795)
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: The existence of \(P_{\geq3}\)-factor covered graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The existence of \(P_{\geq3}\)-factor covered graphs |
scientific article |
Statements
The existence of \(P_{\geq3}\)-factor covered graphs (English)
0 references
13 October 2017
0 references
\(P_{\geq3}\)-factor
0 references
\(P_{\geq3}\)-factor covered graph
0 references
toughness
0 references
isolated toughness
0 references
regular graph.
0 references
0.9350696
0 references
0.9339341
0 references
0 references
0.89733523
0 references
