Counterexamples to the Edge Reconstruction Conjecture for infinite graphs (Q1257028): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123301473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to the countable version of a conjecture of Ulam / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler counterexample to the reconstruction conjecture for denumerable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the line reconstruction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge reconstruction hypothesis is true for graphs with more than n log n edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The falsity of the reconstruction conjecture for tournaments / rank
 
Normal rank

Latest revision as of 02:05, 13 June 2024

scientific article
Language Label Description Also known as
English
Counterexamples to the Edge Reconstruction Conjecture for infinite graphs
scientific article

    Statements

    Counterexamples to the Edge Reconstruction Conjecture for infinite graphs (English)
    0 references
    0 references
    1978
    0 references
    0 references
    Counterexamples
    0 references
    Edge Reconstruction
    0 references
    Infinite Graphs
    0 references
    Vertex Reconstruction Conjecture
    0 references
    0 references