The following pages link to Bennet Manvel (Q1220939):
Displaying 29 items.
- (Q801085) (redirect page) (← links)
- Hamiltonian cycles in cubic 3-connected bipartite planar graphs (Q801087) (← links)
- Correction: Determining connectedness from subdigraphs (Q1220940) (← links)
- On reconstructing graphs from their sets of subgraphs (Q1229231) (← links)
- Some basic observations on Kelly's conjecture for graphs (Q1844860) (← links)
- Reconstruction of maximal outerplanar graphs (Q2552507) (← links)
- Reconstructing the degree pair sequence of a digraph (Q2555081) (← links)
- Determining connectedness from subdigraphs (Q2562869) (← links)
- (Q3684143) (← links)
- (Q3775564) (← links)
- (Q3824449) (← links)
- Optimal Vertex Partitions (Q3856792) (← links)
- (Q3946193) (← links)
- On Reconstruction of Matrices (Q4087349) (← links)
- Counterfeit Coin Problems (Q4123324) (← links)
- Nearly acyclic graphs are reconstructible (Q4159408) (← links)
- (Q4186366) (← links)
- Separation of graphs into three components by the removal of edges (Q4193512) (← links)
- (Q4404937) (← links)
- (Q4742811) (← links)
- (Q4873757) (← links)
- On reconstruction of graphs (Q5577688) (← links)
- Reconstruction of Cacti (Q5578818) (← links)
- (Q5590661) (← links)
- (Q5597453) (← links)
- Reconstruction of Trees (Q5597454) (← links)
- (Q5611646) (← links)
- (Q5661530) (← links)
- (Q5663893) (← links)
