Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1904.11901 / rank | |||
Normal rank | |||
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: Q4749868 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5615948 / 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: Q4414312 / 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: Some basic observations on Kelly's conjecture for graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5423105 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4119240 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite undirected graphs which are not reconstructible from their large cardinality subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3089201 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconstruction from the deck of ‐vertex induced subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconstructing degree sequences from k-vertex-deleted subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3259049 / rank | |||
Normal rank |
Latest revision as of 14:10, 22 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices |
scientific article |
Statements
Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (English)
0 references
30 April 2020
0 references
graph reconstruction
0 references
deck
0 references
reconstructibility
0 references
connected
0 references
0 references