On the public citation graph
Linear forests and ordered cycles
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199701)24:1<45::aid-jgt6>3.0.co;2-jopenalex-snapshot
k-ordered Hamiltonian graphs
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199909)32:1<17::aid-jgt2>3.3.co;2-7openalex-snapshot
On k‐ordered Hamiltonian graphs
inferredcites →https://doi.org/10.1002/1097-0118(200010)35:2<69::aid-jgt1>3.3.co;2-9openalex-snapshot
On k‐ordered graphs
inferredcites →https://doi.org/10.1006/jctb.2000.2022openalex-snapshot
Long Cycles through a Linear Forest
inferredcites →https://doi.org/10.1007/bf02993903openalex-snapshot
Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
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.20152openalex-snapshot
Iterated line graphs are maximally ordered
inferred← citeshttps://doi.org/10.1002/jgt.20564openalex-snapshot
Distributing vertices on Hamiltonian cycles
inferred← citeshttps://doi.org/10.1007/978-3-540-93952-8openalex-snapshot
Graph Factors and Matching Extensions
inferred← citeshttps://doi.org/10.1007/s00373-002-0492-xopenalex-snapshot
Advances on the Hamiltonian Problem - A Survey
inferred← citeshttps://doi.org/10.1007/s00373-013-1377-xopenalex-snapshot
Recent Advances on the Hamiltonian Problem: Survey III
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.017openalex-snapshot
A look at cycles containing specified elements of a graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.07.014openalex-snapshot
On the 1-fault hamiltonicity for graphs satisfying Oreʼs theorem
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.01.002openalex-snapshot
k-Ordered Hamilton cycles in digraphs
inferred← citeshttps://doi.org/10.1017/s0963548307008759openalex-snapshot
Linkedness and Ordered Cycles in Digraphs
inferred← citeshttps://doi.org/10.37236/3594openalex-snapshot
Extensions to 2-Factors in Bipartite Graphs
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.