Reconstructing the degree pair sequence of a digraph (Q2555081): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On nonreconstructable tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ulam's conjecture for separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the problem of reconstructing a tournament from subtournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5516078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5516079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reconstruction of a Tree from its Maximal Subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reconstructing a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5597453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of Cacti / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reconstruction of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank

Latest revision as of 11:43, 12 June 2024

scientific article
Language Label Description Also known as
English
Reconstructing the degree pair sequence of a digraph
scientific article

    Statements