A short proof of a theorem on degree sets of graphs (Q875603): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q3230887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sets for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the least size of a graph with a given degree set / rank
 
Normal rank

Latest revision as of 17:16, 25 June 2024

scientific article
Language Label Description Also known as
English
A short proof of a theorem on degree sets of graphs
scientific article

    Statements