On \(k\)-critical connected line graphs (Q1127873): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:07, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On \(k\)-critical connected line graphs |
scientific article |
Statements
On \(k\)-critical connected line graphs (English)
0 references
10 August 1998
0 references
We show that any line graph contains a set of three vertices which is not included in a smallest separating vertex set.
0 references
connectivity
0 references
line graph
0 references
\(k\)-critical connected
0 references
