The square of a connected S(K1,3)-free graph is vertex pancyclic (Q3815333)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The square of a connected S(K1,3)-free graph is vertex pancyclic |
scientific article |
Statements
The square of a connected S(K1,3)-free graph is vertex pancyclic (English)
0 references
1985
0 references
vertex pancyclic square
0 references
