On the public citation graph

Hamiltonian circuits in graphs and digraphs

https://doi.org/10.1007/bfb0060123
0 signed · 32 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.1007/bf02759704openalex-snapshot
On Hamiltonian bipartite graphs
inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot
Theory of Graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1966-0188103-0openalex-snapshot
On Hamiltonian Circuits in Finite Graphs
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs
inferredcites →https://doi.org/10.2307/2282802openalex-snapshot
Structural Models: An Introduction to the Theory of Directed Graphs.
inferredcites →https://doi.org/10.2307/3007289openalex-snapshot
Structural Models: An Introduction to the Theory of Directed Graphs
inferredcites →https://doi.org/10.5948/upo9780883859490openalex-snapshot
Graphs and Their Uses

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.23233openalex-snapshot
On Three Conjectures of Thomassen and the Extremal Digraphs for Two Conjectures of Nash‐Williams
inferred← citeshttps://doi.org/10.1002/jgt.3190050102openalex-snapshot
Cycles in digraphs– a survey
inferred← citeshttps://doi.org/10.1002/jgt.3190080111openalex-snapshot
On the existence of a specified cycle in digraphs with constraints on degrees
inferred← citeshttps://doi.org/10.1002/nav.3800300107openalex-snapshot
The traveling salesman problem: An update of research
inferred← citeshttps://doi.org/10.1006/eujc.2001.0517openalex-snapshot
An Ore-type Condition for Cyclability
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_26openalex-snapshot
Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/bf00571188openalex-snapshot
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
inferred← citeshttps://doi.org/10.1007/bfb0059438openalex-snapshot
Hamiltonian arcs and circuits
inferred← citeshttps://doi.org/10.1007/s00373-006-0649-0openalex-snapshot
Toughness in Graphs – A Survey
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90028-1openalex-snapshot
Sur les parcours hamiltoniens dans les graphes orientes
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90084-xopenalex-snapshot
Arc-disjoint circuits in digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00057-4openalex-snapshot
Hamiltonian circuits in chordal bipartite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00190-8openalex-snapshot
Toughness, hamiltonicity and split graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90249-aopenalex-snapshot
Alternating Hamiltonian circuits in edge-coloured bipartite graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50002-6openalex-snapshot
10.1016/b978-044488002-4/50002-6
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.025openalex-snapshot
A note on traversing specified vertices in graphs embedded with large representativity
inferred← citeshttps://doi.org/10.1016/j.disc.2011.11.032openalex-snapshot
A degree condition for cycles of maximum length in bipartite digraphs
inferred← citeshttps://doi.org/10.1109/csitechnol.2015.7358250openalex-snapshot
On Hamiltonian bypasses in digraphs with the condition of Y. Manoussakis
inferred← citeshttps://doi.org/10.1109/csitechnol.2017.8312150openalex-snapshot
A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs
inferred← citeshttps://doi.org/10.1112/s0024609303002315openalex-snapshot
CRISPIN ST J. A. NASH-WILLIAMS (1932–2001)
inferred← citeshttps://doi.org/10.1134/s105466182401005xopenalex-snapshot
On Hamiltonian Cycles in a 2-Strong Digraphs with Large Degrees and Cycles
inferred← citeshttps://doi.org/10.1134/s1054661825700671openalex-snapshot
On Special Suborgraphs in Orgraphs with Large Semidegrees
inferred← citeshttps://doi.org/10.1587/transinf.2017fcp0007openalex-snapshot
Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes
inferred← citeshttps://doi.org/10.33915/etd.11329openalex-snapshot
A study on supereulerian digraphs and spanning trails in digraphs
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.