A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60326858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability and uniqueness in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the Erdos-Gallai theorem on graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3230887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme degree sequences of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seven criteria for integer sequences being graphic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple criterion on degree sequences of graphs / rank
 
Normal rank

Latest revision as of 19:16, 2 July 2024

scientific article
Language Label Description Also known as
English
A short constructive proof of the Erdős-Gallai characterization of graphic lists
scientific article

    Statements