A degree condition for cycles of maximum length in bipartite digraphs (Q409445): 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: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / 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: 6023645 / rank
 
Normal rank
Property / zbMATH Keywords
 
digraph
Property / zbMATH Keywords: digraph / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartite digraph
Property / zbMATH Keywords: bipartite digraph / rank
 
Normal rank
Property / zbMATH Keywords
 
cycle
Property / zbMATH Keywords: cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
hamiltonicity
Property / zbMATH Keywords: hamiltonicity / rank
 
Normal rank

Revision as of 18:13, 29 June 2023

scientific article
Language Label Description Also known as
English
A degree condition for cycles of maximum length in bipartite digraphs
scientific article

    Statements

    A degree condition for cycles of maximum length in bipartite digraphs (English)
    0 references
    0 references
    0 references
    13 April 2012
    0 references
    digraph
    0 references
    bipartite digraph
    0 references
    cycle
    0 references
    hamiltonicity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references