On the public citation graph
On crossing numbers of hypercubes and cube connected cycles
0 signed · 39 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.3190150109openalex-snapshot
Bounds for the crossing number of the N ‐cube
inferredcites →https://doi.org/10.1016/0095-8956(72)90042-1openalex-snapshot
A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d)
inferredcites →https://doi.org/10.1016/0095-8956(78)90014-xopenalex-snapshot
The crossing number of C3 × Cn
inferredcites →https://doi.org/10.1016/0898-1221(88)90213-1openalex-snapshot
A survey of the theory of hypercube graphs
inferredcites →https://doi.org/10.1016/s0021-9800(70)80087-4openalex-snapshot
The crossing number of K
inferredcites →https://doi.org/10.1080/00029890.1973.11993230openalex-snapshot
Crossing Number Problems
inferredcites →https://doi.org/10.1109/sfcs.1979.43openalex-snapshot
The cube-connected-cycles: A versatile network for parallel computation
inferredcites →https://doi.org/10.1109/sfcs.1981.22openalex-snapshot
New lower bound techniques for VLSI
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
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.20330openalex-snapshot
An improved upper bound on the crossing number of the hypercube
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_8openalex-snapshot
An Improved Lower Bound for Crossing Numbers
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_68openalex-snapshot
Improved bounds for the crossing numbers on surfaces of genus g
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_53openalex-snapshot
Book embeddings and crossing numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_20openalex-snapshot
An Improved Upper Bound on the Crossing Number of the Hypercube
inferred← citeshttps://doi.org/10.1007/978-3-642-25462-8_40openalex-snapshot
On the Crossing Number of Generalized Fat Trees
inferred← citeshttps://doi.org/10.1007/bf02086611openalex-snapshot
Drawings of Graphs on Surfaces with Few Crossings
inferred← citeshttps://doi.org/10.1007/bfb0054317openalex-snapshot
The splitting number of the 4-cube
inferred← citeshttps://doi.org/10.1007/s12293-013-0115-5openalex-snapshot
$$K$$ -page crossing number minimization problem: An evaluation of heuristics and its solution using GESAKP
inferred← citeshttps://doi.org/10.1016/0167-9260(94)90021-3openalex-snapshot
On VLSI layouts of the star graph and related networks
inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.001openalex-snapshot
Matching preclusion for cube-connected cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.070openalex-snapshot
The crossing number of locally twisted cubes LTQn
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.031openalex-snapshot
Fan-crossing free graphs and their relationship to other beyond-planar graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00314-6openalex-snapshot
Algorithms for the fixed linear crossing number problem
inferred← citeshttps://doi.org/10.1080/00207160.2012.726711openalex-snapshot
An upper bound for the crossing number of augmented cubes
inferred← citeshttps://doi.org/10.1109/i-span.2008.36openalex-snapshot
Resource Placement in Cube-Connected Cycles
inferred← citeshttps://doi.org/10.1142/s0219265903000714openalex-snapshot
IMPROVED BOUNDS FOR THE CROSSING NUMBER OF THE MESH OF TREES
inferred← citeshttps://doi.org/10.1155/2017/7640347openalex-snapshot
Bound for the 2-Page Fixed Linear Crossing Number of Hypercube Graph via SDP Relaxation
inferred← citeshttps://doi.org/10.1587/transfun.2021eap1144openalex-snapshot
On the Crossing Number of a Torus Network
inferred← citeshttps://doi.org/10.48550/arxiv.1101.3386openalex-snapshot
The crossing number of folded hypercubes
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3483openalex-snapshot
The crossing number of cubes with small order
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4227openalex-snapshot
The crossing number of locally twisted cubes
inferred← citeshttps://doi.org/10.48550/arxiv.1901.05155openalex-snapshot
A survey of graphs with known or bounded crossing numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1907.06245openalex-snapshot
A new bound for the crossing number of wrapped butterflies
inferred← citeshttps://doi.org/10.5120/6356-8782openalex-snapshot
Crossing Number of Join of Triangular Snake with mK1, Path and Cycle
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.