Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082): 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: 05C30 / 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: 05C42 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6656165 / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamilton cycles
Property / zbMATH Keywords: Hamilton cycles / rank
 
Normal rank
Property / zbMATH Keywords
 
oriented graphs
Property / zbMATH Keywords: oriented graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
packing
Property / zbMATH Keywords: packing / rank
 
Normal rank
Property / zbMATH Keywords
 
counting
Property / zbMATH Keywords: counting / rank
 
Normal rank

Revision as of 07:06, 28 June 2023

scientific article
Language Label Description Also known as
English
Counting and packing Hamilton cycles in dense graphs and oriented graphs
scientific article

    Statements

    Counting and packing Hamilton cycles in dense graphs and oriented graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2016
    0 references
    Hamilton cycles
    0 references
    oriented graphs
    0 references
    packing
    0 references
    counting
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references