The following pages link to S. Goodman (Q1219554):
Displayed 15 items.
- A linear algorithm for the domination number of a tree (Q1219556) (← links)
- Sufficient conditions for a graph to be Hamiltonian (Q2265440) (← links)
- (Q4050641) (← links)
- Advances on the Hamiltonian Completion Problem (Q4063184) (← links)
- (Q4074925) (← links)
- (Q4079642) (← links)
- (Q4083712) (← links)
- On the optional hamiltonian completion problem (Q4085751) (← links)
- <i>b</i>-Matchings in Trees (Q4087194) (← links)
- An algorithm for the longest cycle problem (Q4108141) (← links)
- (Q4123349) (← links)
- S.A. Lebedev and the birth of Soviet computing (Q4501834) (← links)
- Eulerian Walks in Graphs (Q5654071) (← links)
- On Hamiltonian Walks in Graphs (Q5686063) (← links)
- (Q6121569) (← links)