On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem (Q456147): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C07 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6098097 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / zbMATH Keywords
 
degree
Property / zbMATH Keywords: degree / rank
 
Normal rank
Property / zbMATH Keywords
 
Ore's theorem
Property / zbMATH Keywords: Ore's theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamiltonian
Property / zbMATH Keywords: Hamiltonian / rank
 
Normal rank
Property / zbMATH Keywords
 
1-fault Hamiltonian
Property / zbMATH Keywords: 1-fault Hamiltonian / rank
 
Normal rank

Revision as of 12:38, 30 June 2023

scientific article
Language Label Description Also known as
English
On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
scientific article

    Statements

    On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem (English)
    0 references
    0 references
    0 references
    0 references
    23 October 2012
    0 references
    combinatorial problems
    0 references
    degree
    0 references
    Ore's theorem
    0 references
    Hamiltonian
    0 references
    1-fault Hamiltonian
    0 references

    Identifiers