S. Goodman

zbMath Opengoodman.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
scientific article; zbMATH DE number 7809811 (Why is no real title available?)	2024-02-27	Paper
S.A. Lebedev and the birth of Soviet computing IEEE Annals of the History of Computing	2000-09-10	Paper
On the optional hamiltonian completion problem Networks	1976-01-01	Paper
b-Matchings in Trees SIAM Journal on Computing	1976-01-01	Paper
An algorithm for the longest cycle problem Networks	1976-01-01	Paper
A linear algorithm for the domination number of a tree Information Processing Letters	1975-01-01	Paper
scientific article; zbMATH DE number 3549014 (Why is no real title available?)	1975-01-01	Paper
Advances on the Hamiltonian Completion Problem Journal of the ACM	1975-01-01	Paper
On Hamiltonian Walks in Graphs SIAM Journal on Computing	1974-01-01	Paper
Sufficient conditions for a graph to be Hamiltonian Journal of Combinatorial Theory. Series B	1974-01-01	Paper
scientific article; zbMATH DE number 3465355 (Why is no real title available?)	1974-01-01	Paper
scientific article; zbMATH DE number 3497935 (Why is no real title available?)	1974-01-01	Paper
Eulerian Walks in Graphs SIAM Journal on Computing	1973-01-01	Paper
scientific article; zbMATH DE number 3501535 (Why is no real title available?)	1973-01-01	Paper
scientific article; zbMATH DE number 3492716 (Why is no real title available?)	1973-01-01	Paper

Research outcomes over time

This page was built for person: S. Goodman