On the public citation graph
On the Structure of Hamiltonian Graphs with Small Independence Number
0 signed · 19 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.1006/jctb.2001.2041openalex-snapshot
A Generalization of a Theorem of Dirac
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf00571188openalex-snapshot
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
inferredcites →https://doi.org/10.1007/s00373-002-0492-xopenalex-snapshot
Advances on the Hamiltonian Problem - A Survey
inferredcites →https://doi.org/10.1016/0012-365x(72)90079-9openalex-snapshot
A note on Hamiltonian circuits
inferredcites →https://doi.org/10.1016/0012-365x(93)90223-gopenalex-snapshot
Paths in interval graphs and circular arc graphs
inferredcites →https://doi.org/10.1016/0012-365x(95)00057-4openalex-snapshot
Hamiltonian circuits in chordal bipartite graphs
inferredcites →https://doi.org/10.1016/0020-0190(85)90050-xopenalex-snapshot
Finding Hamiltonian circuits in interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(86)90135-3openalex-snapshot
Hamiltonian circuits in interval graph generalizations
inferredcites →https://doi.org/10.1016/0020-0190(89)90059-8openalex-snapshot
The Hamiltonian circuit problem for circle graphs is NP-complete
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1112/plms/pdw004openalex-snapshot
Proof of the middle levels conjecture
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs
inferredcites →https://doi.org/10.1137/0205049openalex-snapshot
The Planar Hamiltonian Circuit Problem is NP-Complete
inferredcites →https://doi.org/10.1145/3188745.3188834openalex-snapshot
Sparse Kneser graphs are Hamiltonian
inferredcites →https://doi.org/10.1145/3798129.3800747openalex-snapshot
Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
inferredcites →https://doi.org/10.48550/arxiv.2309.09228openalex-snapshot
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
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.