Degree sum and connectivity conditions for dominating cycles (Q2477385): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A generalization of a result of Häggkvist and Nicoghossian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two sufficient conditions for dominating cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3335818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sums, connectivity and dominating cycles in graphs / rank
 
Normal rank

Latest revision as of 18:25, 27 June 2024

scientific article
Language Label Description Also known as
English
Degree sum and connectivity conditions for dominating cycles
scientific article

    Statements

    Degree sum and connectivity conditions for dominating cycles (English)
    0 references
    0 references
    13 March 2008
    0 references
    degree sum
    0 references
    connectivity
    0 references
    dominating cycle
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references