Proof of Harary's conjecture on the reconstruction of trees (Q1169484): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123154215, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Ulam's conjecture for separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph reconstruction—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5544087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / 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: Trees with Hamiltonian square / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reconstruction of maximal planar graphs. II: Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143330 / rank
 
Normal rank

Latest revision as of 16:55, 13 June 2024

scientific article
Language Label Description Also known as
English
Proof of Harary's conjecture on the reconstruction of trees
scientific article

    Statements

    Proof of Harary's conjecture on the reconstruction of trees (English)
    0 references
    0 references
    1983
    0 references
    0 references
    cutvertices
    0 references
    cutvertex-deleted subgraphs
    0 references
    0 references