A sufficient condition for <i>n</i> ‐connectedness of graphs (Q5563927): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (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.1112/s0025579300002369 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144187080 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:52, 30 July 2024
scientific article; zbMATH DE number 3279776
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for <i>n</i> ‐connectedness of graphs |
scientific article; zbMATH DE number 3279776 |
Statements
A sufficient condition for <i>n</i> ‐connectedness of graphs (English)
0 references
1968
0 references
topology
0 references
