Large cycles in 4-connected graphs (Q626774): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs into Open Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two sufficient conditions for Hamilton and dominating cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sums, connectivity and dominating cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4141844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sum condition with connectivity for relative length of longest paths and cycles / rank
 
Normal rank

Revision as of 18:35, 3 July 2024

scientific article
Language Label Description Also known as
English
Large cycles in 4-connected graphs
scientific article

    Statements

    Large cycles in 4-connected graphs (English)
    0 references
    0 references
    0 references
    18 February 2011
    0 references
    Hamilton cycle
    0 references
    dominating cycle
    0 references
    longest cycle
    0 references
    minimum degree
    0 references
    connectivity
    0 references

    Identifiers

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