An implicit degree condition for relative length of long paths and cycles in graphs (Q287873): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Hao Li / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6583911 / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamiltonian path
Property / zbMATH Keywords: Hamiltonian path / rank
 
Normal rank
Property / zbMATH Keywords
 
dominating cycles
Property / zbMATH Keywords: dominating cycles / rank
 
Normal rank
Property / zbMATH Keywords
 
implicit degree
Property / zbMATH Keywords: implicit degree / rank
 
Normal rank
Property / zbMATH Keywords
 
longest paths
Property / zbMATH Keywords: longest paths / rank
 
Normal rank
Property / zbMATH Keywords
 
longest cycles
Property / zbMATH Keywords: longest cycles / rank
 
Normal rank

Revision as of 19:04, 27 June 2023

scientific article
Language Label Description Also known as
English
An implicit degree condition for relative length of long paths and cycles in graphs
scientific article

    Statements

    An implicit degree condition for relative length of long paths and cycles in graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 May 2016
    0 references
    Hamiltonian path
    0 references
    dominating cycles
    0 references
    implicit degree
    0 references
    longest paths
    0 references
    longest cycles
    0 references

    Identifiers