A Chvátal--Erdős type condition for pancyclability (Q878642): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2005.11.093 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly pancyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through subsets with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal-Erdös condition and pancyclism / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2005.11.093 / rank
 
Normal rank

Latest revision as of 06:43, 10 December 2024

scientific article
Language Label Description Also known as
English
A Chvátal--Erdős type condition for pancyclability
scientific article

    Statements

    A Chvátal--Erdős type condition for pancyclability (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    Hamiltonian graphs
    0 references
    pancyclic graphs
    0 references
    cycles
    0 references
    connectivity
    0 references
    independence number
    0 references
    cyclability
    0 references
    pancyclability
    0 references

    Identifiers