The following pages link to Robert R. Molina (Q241267):
Displaying 32 items.
- (Q696912) (redirect page) (← links)
- Reconstructing infinite sets of integers (Q696913) (← links)
- Randomly \(P_k\)-decomposable graphs (Q713169) (← links)
- (Q1126304) (redirect page) (← links)
- Degree conditions for vertex switching reconstruction (Q1126305) (← links)
- On the coding of ordered graphs (Q1266307) (← links)
- Acyclicity of switching classes (Q1266389) (← links)
- On minimal imperfect graphs without induced \(P_5\) (Q1293187) (← links)
- Graph characterising polynomials (Q1304820) (← links)
- The cyclic groups with the \(m\)-DCI property (Q1367594) (← links)
- The centroidal branches of a separable graph are edge reconstructible (Q1377714) (← links)
- On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
- Reconstructing infinite objects (Q1613458) (← links)
- On the spectral Ádám property for circulant graphs (Q1613548) (← links)
- On a reconstruction problem of Harary and Manvel (Q1865368) (← links)
- Graph recurrence (Q1869026) (← links)
- Regular bipartite graphs with all 2-factors isomorphic (Q1880796) (← links)
- On the fixed edge of planar graphs with minimum degree five (Q1917509) (← links)
- (Q2716534) (← links)
- (Q3582506) (← links)
- (Q3838210) (← links)
- (Q4386087) (← links)
- (Q4390665) (← links)
- (Q4405774) (← links)
- (Q4529457) (← links)
- The edge reconstruction number of a disconnected graph (Q4698087) (← links)
- (Q4856614) (← links)
- (Q4862902) (← links)
- (Q5252056) (← links)
- (Q5443269) (← links)
- A proof of the two-path conjecture (Q5960794) (← links)
- Reconstruction numbers for unicyclic graphs (Q6656038) (← links)
