Hamiltonian cycles and dominating cycles passing through a linear forest (Q1024474): 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: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A look at cycles containing specified elements of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on the Hamiltonian problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits through specified edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of a Theorem of Posa / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342985 / rank
 
Normal rank

Revision as of 15:48, 1 July 2024

scientific article
Language Label Description Also known as
English
Hamiltonian cycles and dominating cycles passing through a linear forest
scientific article

    Statements

    Hamiltonian cycles and dominating cycles passing through a linear forest (English)
    0 references
    0 references
    0 references
    17 June 2009
    0 references
    degree sum
    0 references
    connectivity
    0 references
    Hamiltonian cycle
    0 references
    dominating cycle
    0 references
    linear forest
    0 references

    Identifiers