3-regular graphs are 2-reconstructible (Q2225421)

From MaRDI portal
Revision as of 01:04, 13 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q312270)
scientific article
Language Label Description Also known as
English
3-regular graphs are 2-reconstructible
scientific article

    Statements

    3-regular graphs are 2-reconstructible (English)
    0 references
    0 references
    0 references
    0 references
    8 February 2021
    0 references
    \(\ell\)-reconstructible graphs
    0 references
    3-regular graphs
    0 references

    Identifiers