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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.09.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976424262 / 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: A remark on the existence of finite graphs / 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
links / mardi / namelinks / mardi / name
 

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