A generalization of Dirac's theorem for \(K(1,3)\)-free graphs (Q1813059): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood unions and a generalization of Dirac's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbourhood unions and Hamiltonian properties in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest paths and cycles in K1,3-free graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02651085 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994517498 / rank
 
Normal rank

Latest revision as of 10:12, 30 July 2024

scientific article
Language Label Description Also known as
English
A generalization of Dirac's theorem for \(K(1,3)\)-free graphs
scientific article

    Statements

    A generalization of Dirac's theorem for \(K(1,3)\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    See the preview in Zbl 0738.05054.
    0 references
    Dirac's theorem
    0 references
    K(1,3)-free graphs
    0 references
    traceability
    0 references
    hamiltonian- connectedness
    0 references
    pancyclicity
    0 references

    Identifiers