Size reconstructibility of graphs (Q6055396): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3115033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost every graph has reconstruction number three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph reconstruction—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of pairs of graphs with a large number of common cards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing connectedness from vertex-deleted subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of a graph is reconstructible from any \(n-2\) cards / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Graph Automorphisms and Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree sequence is reconstructible from \(n-1\) cards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards size reconstruction from fewer cards / rank
 
Normal rank

Revision as of 00:52, 3 August 2024

scientific article; zbMATH DE number 7743896
Language Label Description Also known as
English
Size reconstructibility of graphs
scientific article; zbMATH DE number 7743896

    Statements

    Size reconstructibility of graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2023
    0 references
    common cards
    0 references
    graph reconstruction
    0 references
    partial deck
    0 references
    size reconstruction
    0 references
    vertex-deleted subgraphs
    0 references

    Identifiers