The degree sequence is reconstructible from \(n-1\) cards (Q1193716): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wendy J. Myrvold / rank
Normal rank
 
Property / author
 
Property / author: Wendy J. Myrvold / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class-reconstruction of total graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph reconstruction—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reconstruction of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:22, 16 May 2024

scientific article
Language Label Description Also known as
English
The degree sequence is reconstructible from \(n-1\) cards
scientific article

    Statements

    The degree sequence is reconstructible from \(n-1\) cards (English)
    0 references
    27 September 1992
    0 references
    degree sequence
    0 references
    vertex-deleted subgraph
    0 references
    card
    0 references
    0 references

    Identifiers