S. Goodman
From MaRDI portal
Person:1219554
Available identifiers
zbMath Open goodman.seymour-eMaRDI QIDQ1219554
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| https://portal.mardi4nfdi.de/entity/Q6121569 | 2024-02-27 | Paper |
| S.A. Lebedev and the birth of Soviet computing | 2000-09-10 | Paper |
| On the optional hamiltonian completion problem | 1976-01-01 | Paper |
| b-Matchings in Trees | 1976-01-01 | Paper |
| An algorithm for the longest cycle problem | 1976-01-01 | Paper |
| A linear algorithm for the domination number of a tree | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4123349 | 1975-01-01 | Paper |
| Advances on the Hamiltonian Completion Problem | 1975-01-01 | Paper |
| On Hamiltonian Walks in Graphs | 1974-01-01 | Paper |
| Sufficient conditions for a graph to be Hamiltonian | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050641 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079642 | 1974-01-01 | Paper |
| Eulerian Walks in Graphs | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083712 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4074925 | 1973-01-01 | Paper |
Research outcomes over time
This page was built for person: S. Goodman
