A necessary and sufficient condition for a graph to be edge tenacious (Q5936066): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127098063, #quickstatements; #temporary_batch_1722465628192 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00400-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969240536 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127098063 / rank | |||
Normal rank | |||
Latest revision as of 23:56, 31 July 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
