On the public citation graph

Extending matchings to Hamiltonian paths with prescribed endvertices in $k$-ary $n$-cubes

0 signed · 18 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/net.20290openalex-snapshot

Panconnectivity and edge‐pancyclicity of k‐ary n‐cubes

inferredcites →https://doi.org/10.1016/j.dam.2011.05.008openalex-snapshot

Hamiltonian cycles passing through linear forests in k -ary n -cubes

inferredcites →https://doi.org/10.1016/j.ins.2011.03.011openalex-snapshot

Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube

inferredcites →https://doi.org/10.1016/j.ins.2015.02.005openalex-snapshot

Matchings extend to Hamiltonian cycles in k-ary n-cubes

inferredcites →https://doi.org/10.1016/j.jpdc.2005.10.004openalex-snapshot

Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes

inferredcites →https://doi.org/10.1016/j.jpdc.2021.07.020openalex-snapshot

Exponential type of many-to-many edge disjoint paths on ternary n-cubes

inferredcites →https://doi.org/10.1016/j.jpdc.2024.104887openalex-snapshot

Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model

inferredcites →https://doi.org/10.1016/j.tcs.2011.02.030openalex-snapshot

Embedding hamiltonian paths in k -ary n -cubes with conditional edge faults

inferredcites →https://doi.org/10.1016/j.tcs.2011.04.035openalex-snapshot

One-to-one disjoint path covers on k -ary n -cubes

inferredcites →https://doi.org/10.1016/j.tcs.2013.04.002openalex-snapshot

Many-to-many disjoint path covers in k -ary n -cubes

inferredcites →https://doi.org/10.1016/j.tcs.2018.03.029openalex-snapshot

A type of perfect matchings extend to hamiltonian cycles in k-ary n-cubes

inferredcites →https://doi.org/10.1016/j.tcs.2018.09.020openalex-snapshot

Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes

inferredcites →https://doi.org/10.1109/12.403718openalex-snapshot

Lee distance and topological properties of k-ary n-cubes

inferredcites →https://doi.org/10.1109/tc.2003.1234525openalex-snapshot

Edge disjoint hamiltonian cycles in k-ary n-cubes and hypercubes

inferredcites →https://doi.org/10.1109/tpds.2014.2311794openalex-snapshot

Fault-Free Hamiltonian Cycles Passing through Prescribed Edges in $k$ -Ary $n$ -Cubes with Faulty Edges

inferredcites →https://doi.org/10.1109/tpds.2021.3126254openalex-snapshot

Hamiltonian Paths of -cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests

inferredcites →https://doi.org/10.1137/s0895480103432805openalex-snapshot

Hamiltonian Cycles with Prescribed Edges in Hypercubes

inferredcites →https://doi.org/10.1137/s0895480196311183openalex-snapshot

Fault-Tolerant Embeddings of Hamiltonian Circuits in k -ary n -Cubes

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.