The square of a connected \(S(K_{1,3})\)-free graph is vertex pancyclic. (English) Zbl 0664.05038
We prove the conjecture of Gould and Jacobson that a connected \(S(K_{1,3})\)-free graph has a vertex pancyclic square. Since \(S(K_{1,3})^ 2\) is not vertex pancyclic, this result is best possible.
MSC:
| 05C38 | Paths and cycles |
Keywords:
vertex pancyclic squareReferences:
| [1] | , and , Graphs and Digraphs. Prindle, Weber and Schmidt, Boston (1979). |
| [2] | Fleischner, J. Combinatorial Theory Ser. B 16 pp 29– (1974) |
| [3] | Fleischner, Monatsh. Math. 82 pp 125– (1976) |
| [4] | Gould, J. Graph Theory 8 pp 147– (1984) |
| [5] | Harary, Mathematika 18 pp 138– (1971) |
| [6] | Matthews, J. Graph Theory 8 pp 139– (1984) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
