Pages that link to "Item:Q2555081"
From MaRDI portal
The following pages link to Reconstructing the degree pair sequence of a digraph (Q2555081):
Displayed 6 items.
- Reconstructing degree sequences from k-vertex-deleted subgraphs (Q908942) (← links)
- A census of non-reconstructable digraphs. I: Six related families (Q1135862) (← links)
- Reconstruction of infinite graphs (Q1191922) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- Determining connectedness from subdigraphs (Q2562869) (← links)
- A property of most of the known non-reconstructible digraphs (Q5074884) (← links)