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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q592071
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Wai-Kai Chen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.09.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032788707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of given length in some \(K_{1,3}\)-free graphs / rank
 
Normal rank

Latest revision as of 18:56, 25 June 2024

scientific article
Language Label Description Also known as
English
Vertex pancyclicity in quasi claw-free graphs
scientific article

    Statements

    Vertex pancyclicity in quasi claw-free graphs (English)
    0 references
    0 references
    11 May 2007
    0 references
    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
    0 references
    triangularly connected graph
    0 references
    quasi claw-free graph
    0 references
    vertex pancyclicity
    0 references
    0 references
    0 references