The square of a connected S(K_1,3)-free graph is vertex pancyclic

Link:
Autor/in:
Erscheinungsjahr:
1985
Medientyp:
Text
Schlagworte:
  • Article
  • Article
Beschreibung:
  • 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. Copyright © 1985 Wiley Periodicals, Inc., A Wiley Company
Lizenz:
  • info:eu-repo/semantics/closedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/dacee97c-07f3-4317-b6a9-fc3dc2ce2ffb