Degree-associated reconstruction number of graphs (Q709303): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2010.03.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073190088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461492 / 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: ON THE CLASS-RECONSTRUCTION NUMBER OF TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph reconstruction number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on edge reconstruction of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5423105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3483308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ally-reconstruction number of a tree with five or more vertices is three / 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: On a new digraph reconstruction conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: N-reconstructibility of non-reconstructible digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing trees from two cards / rank
 
Normal rank

Latest revision as of 09:00, 3 July 2024

scientific article
Language Label Description Also known as
English
Degree-associated reconstruction number of graphs
scientific article

    Statements

    Degree-associated reconstruction number of graphs (English)
    0 references
    0 references
    0 references
    18 October 2010
    0 references
    0 references
    reconstruction conjecture
    0 references
    reconstruction number
    0 references
    vertex-transitive graph
    0 references
    tree
    0 references
    caterpillar
    0 references
    0 references