The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences (Q1406566): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for constructing graphs and digraphs with given valences and factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation of an extremal theorem due to Woodall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Circuits in Graphs<sup>†</sup> / rank
 
Normal rank

Latest revision as of 10:37, 6 June 2024

scientific article
Language Label Description Also known as
English
The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences
scientific article

    Statements

    The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2003
    0 references
    0 references
    degree sequence
    0 references