On the public citation graph

Matching Extendability in Hypercubes

0 signed · 23 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.1002/(sici)1097-0118(199808)28:4<203::aid-jgt2>3.0.co;2-nopenalex-snapshot
Induced matching extendable graphs
inferredcites →https://doi.org/10.1002/jgt.20226openalex-snapshot
Edge proximity conditions for extendability in cubic bipartite graphs
inferredcites →https://doi.org/10.1007/s00373-006-0673-0openalex-snapshot
Induced Matching Extendable Graph Powers
inferredcites →https://doi.org/10.1016/0012-365x(92)00485-aopenalex-snapshot
Extending matchings in graphs: A survey
inferredcites →https://doi.org/10.1109/12.536232openalex-snapshot
On diagnosability of large fault sets in regular topology-based computer systems
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.21136/mb.1997.126151openalex-snapshot
On $r$-extendability of the hypercube $Q\sb n$

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.1002/jgt.22561openalex-snapshot
Edge precoloring extension of hypercubes
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_29openalex-snapshot
Matching Extendability in Cartesian Product of Hypercubes and Paths
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_30openalex-snapshot
Extending Unlocked Matchings in Graphs
inferred← citeshttps://doi.org/10.1007/s00373-015-1533-6openalex-snapshot
Small Matchings Extend to Hamiltonian Cycles in Hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.041openalex-snapshot
Extending edge-colorings of distance-2 matchings in the hypercube
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.014openalex-snapshot
Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115182openalex-snapshot
Generalized matching extension problem in regular bipartite graphs
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.1137/090776706openalex-snapshot
Perfect Matchings in Grid Graphs after Vertex Deletions
inferred← citeshttps://doi.org/10.1142/s0129626426500040openalex-snapshot
Extending Matchings to Gray Codes in Hypercubes with Prescribed Endpoints
inferred← citeshttps://doi.org/10.1142/s0219265925500215openalex-snapshot
Extending the Size of Matchings to Hamiltonian Cycles in Hypercubes
inferred← citeshttps://doi.org/10.3390/sym17070995openalex-snapshot
Kinds of Matchings Extending to Hamiltonian Cycles in Hypercube Networks
inferred← citeshttps://doi.org/10.37236/3594openalex-snapshot
Extensions to 2-Factors in Bipartite Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2007.04479openalex-snapshot
Signless Laplacian spectral radius and matching in graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2010openalex-snapshot
Matchings extend to Hamiltonian cycles in 5-cube
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.