A necessary and sufficient condition for a graph to be edge tenacious (Q5936066): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:41, 4 March 2024
scientific article; zbMATH DE number 1612927
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
