![](/img/cover-not-exists.png)
The square of a connected S(K1,3)-free graph is vertex pancyclic
George Hendry, Walter VoglerVolume:
9
Year:
1985
Language:
english
Pages:
3
DOI:
10.1002/jgt.3190090415
File:
PDF, 129 KB
english, 1985