On the public citation graph
On the construction of combinedk‐fault‐tolerant Hamiltonian graphs
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.
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-0037(199601)27:1<19::aid-net2>3.0.co;2-hopenalex-snapshot
Node fault tolerance in graphs
inferredcites →https://doi.org/10.1002/jgt.3190100111openalex-snapshot
Minimum k ‐hamiltonian graphs, II
inferredcites →https://doi.org/10.1002/net.3230230207openalex-snapshot
Edge fault tolerance in graphs
inferredcites →https://doi.org/10.1016/0020-0190(92)90192-xopenalex-snapshot
Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
inferredcites →https://doi.org/10.1016/s0020-0190(97)00212-3openalex-snapshot
Enclosing k points in the smallest axis parallel rectangle
inferredcites →https://doi.org/10.1016/s0020-0190(98)00004-0openalex-snapshot
Optimal 1-hamiltonian graphs
inferredcites →https://doi.org/10.1109/71.640010openalex-snapshot
Fault-tolerant ring embedding in a star graph with both link and node failures
inferredcites →https://doi.org/10.1109/ipps.1993.262806openalex-snapshot
On some topological properties of hypercube, incomplete hypercube and supercube
inferredcites →https://doi.org/10.1109/tc.1987.5009493openalex-snapshot
Processor Allocation in an N-Cube Multiprocessor Using Gray Codes
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.21815openalex-snapshot
On Hypohamiltonian and Almost Hypohamiltonian Graphs
inferred← citeshttps://doi.org/10.1002/net.10096openalex-snapshot
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)‐star graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_67openalex-snapshot
A Distributed Algorithm of Fault Recovery for Stateful Failover
inferred← citeshttps://doi.org/10.1016/j.aam.2009.01.005openalex-snapshot
Edge, vertex and mixed fault diameters
inferred← citeshttps://doi.org/10.1016/j.amc.2004.12.016openalex-snapshot
The globally bi-3* and hyper bi-3* connectedness of the spider web networks
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.020openalex-snapshot
Mixed fault diameter of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.025openalex-snapshot
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1109/isvlsi.2016.40openalex-snapshot
Reliable Many-Core System-on-Chip Design Using K-Node Fault Tolerant Graphs
inferred← citeshttps://doi.org/10.1109/pdcat.2006.55openalex-snapshot
Designing Reliable Architecture for Stateful Fault Tolerance
inferred← citeshttps://doi.org/10.1142/s0219265902000677openalex-snapshot
HAMILTONIAN PROPERTIES OF FAULTY RECURSIVE CIRCULANT GRAPHS
inferred← citeshttps://doi.org/10.48550/arxiv.1002.2508openalex-snapshot
Mixed connectivity of Cartesian graph products and bundles
inferred← citeshttps://doi.org/10.5614/ejgta.2013.1.1.6openalex-snapshot
Intersecting longest paths and longest cycles: A survey
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.