A necessary and sufficient condition for a graph to be edge tenacious (Q5936066)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1612927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A necessary and sufficient condition for a graph to be edge tenacious |
scientific article; zbMATH DE number 1612927 |
Statements
A necessary and sufficient condition for a graph to be edge tenacious (English)
0 references
14 May 2002
0 references
The authors give a necessary and sufficient condition for a graph to be edge-tenacious. This result is used to prove that every complete \(n\)-partitite graph is strictly edge-tenacious.
0 references
connectivity
0 references
edge-tenacious
0 references
0 references
0.86986095
0 references
0.8696976
0 references
0.86466223
0 references
0.8635522
0 references
0.8602052
0 references
0.8581847
0 references
0.8570337
0 references
0 references
