On the stability for pancyclicity

@article{Schiermeyer2001OnTS,
  title={On the stability for pancyclicity},
  author={Ingo Schiermeyer},
  journal={Discussiones Mathematicae Graph Theory},
  year={2001},
  volume={21},
  pages={223-228}
}
A property P defined on all graphs of order n is said to be k-stable if for any graph of order n that does not satisfy P , the fact that uv is not an edge of G and that G+uv satisfies P implies dG(u)+dG(v) < k. Every property is (2n−3)-stable and every k-stable property is (k+1)stable. We denote by s(P ) the smallest integer k such that P is k-stable and call it the stability of P . This number usually depends on n and is at most 2n−3. A graph of order n is said to be pancyclic if it contains… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Pancyclic graphs

  • J. A. Bondy
  • in: R.C. Mullin, K.B. Reid, D.P. Roselle and R.S…
  • 1971
2 Excerpts

Similar Papers

Loading similar papers…