On the public citation graph
Extending a perfect matching to a Hamiltonian cycle
0 signed · 25 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/jgt.3190140114openalex-snapshot
Cycles containing matchings and pairwise compatible euler tours
inferredcites →https://doi.org/10.1007/bf00968054openalex-snapshot
Proof of the van der Waerden conjecture for permanents
inferredcites →https://doi.org/10.1016/0012-365x(82)90078-4openalex-snapshot
Circuits through specified edges
inferredcites →https://doi.org/10.1016/0012-365x(83)90264-9openalex-snapshot
Proof of a conjecture of Häggkvist on cycles and independent edges
inferredcites →https://doi.org/10.1016/j.disc.2008.02.013openalex-snapshot
Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
inferredcites →https://doi.org/10.1016/j.ins.2010.02.009openalex-snapshot
On generalized middle-level problem
inferredcites →https://doi.org/10.1016/j.ipl.2008.10.015openalex-snapshot
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
inferredcites →https://doi.org/10.1016/j.jctb.2007.02.007openalex-snapshot
Perfect matchings extend to Hamilton cycles in hypercubes
inferredcites →https://doi.org/10.1016/s0012-365x(98)00216-7openalex-snapshot
On F-Hamiltonian graphs
inferredcites →https://doi.org/10.1137/0406012openalex-snapshot
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
inferredcites →https://doi.org/10.1137/060678476openalex-snapshot
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
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.22371openalex-snapshot
Gray codes extending quadratic matchings
inferred← citeshttps://doi.org/10.1007/s00026-021-00548-1openalex-snapshot
Perfect Matchings and Hamiltonicity in the Cartesian Product of Cycles
inferred← citeshttps://doi.org/10.1007/s00493-017-3731-8openalex-snapshot
Matchings Extend into 2-Factors in Hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2022.06.040openalex-snapshot
Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114441openalex-snapshot
The Pairing-Hamiltonian property in graph prisms
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103111openalex-snapshot
Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.071openalex-snapshot
Towards a problem of Ruskey and Savage on matching extendability
inferred← citeshttps://doi.org/10.13140/rg.2.2.32263.93602openalex-snapshot
Papillon graphs: perfect matchings, Hamiltonian cycles and edge-colourings in cubic graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.23_3openalex-snapshot
Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
inferred← citeshttps://doi.org/10.3390/sym17070995openalex-snapshot
Kinds of Matchings Extending to Hamiltonian Cycles in Hypercube Networks
inferred← citeshttps://doi.org/10.37236/10988openalex-snapshot
Betwixt and Between 2-Factor Hamiltonian and Perfect-Matching-Hamiltonian Graphs
inferred← citeshttps://doi.org/10.37236/9143openalex-snapshot
Extending Perfect Matchings to Hamiltonian Cycles in Line Graphs
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v20i1.73743openalex-snapshot
Saved by the rook: a case of matchings and Hamiltonian cycles
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.