Constructive extensions of two results on graphic sequences (Q411867): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solution to a problem on degree sequences of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short constructive proof of the Erdős-Gallai characterization of graphic lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a theorem of Erdős and Gallai / rank
 
Normal rank

Latest revision as of 03:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Constructive extensions of two results on graphic sequences
scientific article

    Statements

    Constructive extensions of two results on graphic sequences (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2012
    0 references
    0 references
    graphic
    0 references
    bigraphic
    0 references
    realization
    0 references
    lexicographic ordering
    0 references
    good order
    0 references
    0 references