Vertex pancyclicity in quasi claw-free graphs (Q879347): Difference between revisions

The paper shows that every triangularly connected quasi claw-free graph on at least three vertices is vertex pancyclic, thereby solving a conjecture by \textit{A. Ainouche} [Discrete Math. 179, No. 1-3, 13--26 (1998; Zbl 0888.05038)].

0 references

Mathematics Subject Classification ID

05C38

0 references

zbMATH DE Number

5151768

0 references

zbMATH Keywords

triangularly connected graph

0 references

quasi claw-free graph

0 references

vertex pancyclicity

0 references

reviewed by

Wai-Kai Chen

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2006.09.006

0 references

OpenAlex ID

W2032788707

0 references

cites work

Quasi-claw-free graphs

0 references

Q5422499

0 references

Q3958496

0 references

Extending cycles in graphs

0 references

Every connected, locally connected nontrivial graph with no induced claw is hamiltonian

0 references

Cycles of given length in some \(K_{1,3}\)-free graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:879347

@@ Property / cites work @@
+Quasi-claw-free graphs
@@ Property / cites work: Quasi-claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3958496
@@ Property / cites work: Q3958496 / rank @@
+Normal rank
@@ Property / cites work @@
+Extending cycles in graphs
@@ Property / cites work: Extending cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
+Normal rank
@@ Property / cites work @@
+Cycles of given length in some \(K_{1,3}\)-free graphs
+Normal rank