On the public citation graph

An algorithm for finding hamiltonian circuits in certain graphs

https://doi.org/10.1007/bfb0121193
0 signed · 16 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0012-365x(73)90037-xopenalex-snapshot
Algorithms for constructing graphs and digraphs with given valences and factors
inferredcites →https://doi.org/10.1016/0012-365x(76)90068-6openalex-snapshot
Hamiltonian circuits in random graphs
inferredcites →https://doi.org/10.1016/0012-365x(76)90078-9openalex-snapshot
A method in graph theory
inferredcites →https://doi.org/10.1016/0095-8956(72)90020-2openalex-snapshot
On Hamilton's ideals
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs
inferredcites →https://doi.org/10.1137/0110037openalex-snapshot
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.3230100306openalex-snapshot
An algorithm for finding a short closed spanning walk in a graph
inferred← citeshttps://doi.org/10.1007/3-540-10704-5_16openalex-snapshot
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph
inferred← citeshttps://doi.org/10.1007/bf01070234openalex-snapshot
Graphs and degree sequences. I
inferred← citeshttps://doi.org/10.1007/bf01082602openalex-snapshot
Graphs and degree sequences. II
inferred← citeshttps://doi.org/10.1007/bf02096255openalex-snapshot
Selected bibliography on degeneracy
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90109-4openalex-snapshot
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90045-2openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1017/s0334270000003702openalex-snapshot
Detection of Hamiltonian circuits in a directed graph
inferred← citeshttps://doi.org/10.1080/03052158708902546openalex-snapshot
THE HAMILTONIAN COMPLETION PROBLEM AND ITS SOLUTION
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.