On \(k\)-critical connected line graphs (Q1127873)
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 1186389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(k\)-critical connected line graphs |
scientific article; zbMATH DE number 1186389 |
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
