The square of a connected S(K1,3)-free graph is vertex pancyclic |
| |
Authors: | George Hendry Walter Vogler |
| |
Abstract: | We prove the conjecture of Gould and Jacobson that a connected S(K1,3)-free graph has a vertex pancyclic square. Since S(K1,3)2 is not vertex pan-cyclic, this result is best possible. |
| |
Keywords: | |
|
|