Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor (Q1684941): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Best monotone degree conditions for graph properties: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sequences and the existence of \(k\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best monotone degree conditions for binding number and cycle structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strongest monotone degree condition for \(n\)-connectedness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3065457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722819 / rank
 
Normal rank

Latest revision as of 20:06, 14 July 2024

scientific article
Language Label Description Also known as
English
Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
scientific article

    Statements

    Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2017
    0 references
    best monotone degree conditions
    0 references
    2-factor
    0 references
    Hamiltonian cycle
    0 references

    Identifiers