The following pages link to On reconstruction of graphs (Q5577688):
Displayed 11 items.
- The adversary degree-associated reconstruction number of double-brooms (Q491632) (← links)
- Reconstructing degree sequences from k-vertex-deleted subgraphs (Q908942) (← links)
- Weighted graphs and university course timetabling (Q1185992) (← links)
- The degree sequence is reconstructible from \(n-1\) cards (Q1193716) (← links)
- Rélations non reconstructibles par leurs restrictions (Q1223295) (← links)
- On reconstructing graphs from their sets of subgraphs (Q1229231) (← links)
- Fractional isomorphism of graphs (Q1336666) (← links)
- Reconstruction of maximal outerplanar graphs (Q2552507) (← links)
- Reconstructing the degree pair sequence of a digraph (Q2555081) (← links)
- Reconstruction of small graphs and digraphs (Q5090542) (← links)
- 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs (Q6133663) (← links)