On the public citation graph

Embedding of cycles and wheels into arbitrary trees

0 signed · 74 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-0037(199901)33:1<71::aid-net5>3.0.co;2-3openalex-snapshot
Small congestion embedding of graphs into hypercubes
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199905)33:3<221::aid-net8>3.0.co;2-kopenalex-snapshot
Congestion-free, dilation-2 embedding of complete binary trees into star graphs
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199906)31:2<75::aid-jgt1>3.0.co;2-sopenalex-snapshot
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
inferredcites →https://doi.org/10.1002/0470841915.ch2openalex-snapshot
Interconnection Networks
inferredcites →https://doi.org/10.1002/1097-0118(200010)35:2<89::aid-jgt3>3.0.co;2-aopenalex-snapshot
The edge-bandwidth of theta graphs
inferredcites →https://doi.org/10.1007/3-540-47849-3_33openalex-snapshot
Cyclic Cutwidth of the Mesh
inferredcites →https://doi.org/10.1007/978-3-030-36826-5_4openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/bfb0055820openalex-snapshot
Embedding of hypercubes into grids
inferredcites →https://doi.org/10.1007/s002240000089openalex-snapshot
Embedding Complete Binary Trees into Star and Pancake Graphs
inferredcites →https://doi.org/10.1016/0020-0190(92)90108-8openalex-snapshot
On the complexity of tree embedding problems
inferredcites →https://doi.org/10.1016/0095-8956(90)90066-9openalex-snapshot
On embedding graphs in trees
inferredcites →https://doi.org/10.1016/0304-3975(94)00036-iopenalex-snapshot
Two results on linear embeddings of complete binary trees
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00227-2openalex-snapshot
Optimal embeddings of generalized ladders into hypercubes
inferredcites →https://doi.org/10.1016/s0012-365x(97)00239-2openalex-snapshot
On embedding complete graphs into hypercubes
inferredcites →https://doi.org/10.1016/s0012-365x(98)00009-0openalex-snapshot
Bandwidth and density for block graphs
inferredcites →https://doi.org/10.1016/s0012-365x(99)00162-4openalex-snapshot
The congestion of n-cube layout on a rectangular grid
inferredcites →https://doi.org/10.1016/s0166-218x(00)00224-9openalex-snapshot
Efficient embeddings of grids into grids
inferredcites →https://doi.org/10.1016/s0166-218x(00)00256-0openalex-snapshot
Embedding complete trees into the hypercube
inferredcites →https://doi.org/10.1016/s0166-218x(01)00176-7openalex-snapshot
Uniform emulations of Cartesian-product and Cayley graphs
inferredcites →https://doi.org/10.1016/s0166-218x(97)00101-7openalex-snapshot
Embedding ladders and caterpillars into the hypercube
inferredcites →https://doi.org/10.1016/s0166-218x(98)00098-5openalex-snapshot
The cyclic cutwidth of trees
inferredcites →https://doi.org/10.1016/s0166-218x(99)00161-4openalex-snapshot
Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1051/ita:2000128openalex-snapshot
Cutwidth of ther-dimensional Mesh ofd-ary Trees
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/12.485371openalex-snapshot
Embedding star networks into hypercubes
inferredcites →https://doi.org/10.1109/12.494105openalex-snapshot
Embedding an arbitrary binary tree into the star graph
inferredcites →https://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-01123-9_49openalex-snapshot
Wiener Index of Hypertree
inferred← citeshttps://doi.org/10.1007/978-3-031-77764-6_1openalex-snapshot
Optimizing Wirelength in Embedding Turán Graphs into Complete Binary Trees
inferred← citeshttps://doi.org/10.1007/978-3-032-00385-0_45openalex-snapshot
Graph Layout Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_45-2openalex-snapshot
Graph Layout Problems
inferred← citeshttps://doi.org/10.1007/s10878-011-9443-xopenalex-snapshot
Embeddings of circulant networks
inferred← citeshttps://doi.org/10.1007/s11227-023-05095-5openalex-snapshot
Embedding hierarchical folded cubes into linear arrays and complete binary trees with minimum wirelength
inferred← citeshttps://doi.org/10.1007/s11786-015-0232-2openalex-snapshot
Embedding of Recursive Circulants into Certain Necklace Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.09.013openalex-snapshot
Exact wirelength of hypercubes on a grid
inferred← citeshttps://doi.org/10.1016/j.dam.2010.12.001openalex-snapshot
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
inferred← citeshttps://doi.org/10.1016/j.dam.2011.07.003openalex-snapshot
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.007openalex-snapshot
Wirelength of hypercubes into certain trees
inferred← citeshttps://doi.org/10.1016/j.dam.2014.01.002openalex-snapshot
Embedding of hypercubes into sibling trees
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.034openalex-snapshot
Wirelength of embedding complete multipartite graphs into certain graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.08.022openalex-snapshot
On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.03.001openalex-snapshot
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
inferred← citeshttps://doi.org/10.1016/j.endm.2016.05.032openalex-snapshot
Wirelength of Enhanced Hypercubes into r-Rooted Complete Binary Trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.06.011openalex-snapshot
Wirelength of 1-fault hamiltonian graphs into wheels and fans
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.006openalex-snapshot
Embedding of hypercubes into necklace, windmill and snake graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2015.01.001openalex-snapshot
Bothway embedding of circulant network into grid
inferred← citeshttps://doi.org/10.1016/j.procs.2015.07.441openalex-snapshot
Embedding of Hypercube into Extended Rooted Theta Mesh
inferred← citeshttps://doi.org/10.1063/5.0225049openalex-snapshot
Embedding (K9 – C9) n into 2-CAT and triangular snake graph
inferred← citeshttps://doi.org/10.1109/icecct.2015.7226174openalex-snapshot
Network embedding on Planar Octahedron networks
inferred← citeshttps://doi.org/10.1109/spices62143.2024.10779760openalex-snapshot
Efficient Layouts of Complete t-Partite and Complete Networks into 3-Ary n-Cubes for Optimized Parallel Processing in Multiprocessing Systems
inferred← citeshttps://doi.org/10.1142/s0129054123500090openalex-snapshot
Embedding Augmented Cube into Certain Trees and Windmill Graphs
inferred← citeshttps://doi.org/10.1142/s0129054125500224openalex-snapshot
An Upper Bound for Edge Congestion and the Exact Wirelength of Embedding onto BC Graphs
inferred← citeshttps://doi.org/10.1142/s0129626415500085openalex-snapshot
A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees
inferred← citeshttps://doi.org/10.1142/s0219265911003027openalex-snapshot
CIRCULAR WIRELENGTH OF GENERALIZED PETERSEN GRAPHS
inferred← citeshttps://doi.org/10.1142/s0219265912500041openalex-snapshot
EMBEDDING VARIANTS OF HYPERCUBES WITH DILATION 2
inferred← citeshttps://doi.org/10.1142/s0219265913500102openalex-snapshot
Layout of Embedding Circulant Networks into Linear Hexagons and Phenylenes
inferred← citeshttps://doi.org/10.1142/s0219265913500187openalex-snapshot
Embedding of Hypercubes into l-Sibling Trees
inferred← citeshttps://doi.org/10.1142/s0219265923500317openalex-snapshot
Embedding Knödel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis
inferred← citeshttps://doi.org/10.1142/s1793830915500536openalex-snapshot
Maximum incomplete recursive circulants in graph embeddings
inferred← citeshttps://doi.org/10.1166/jctn.2013.2882openalex-snapshot
A New Approach to Compute Wiener Index
inferred← citeshttps://doi.org/10.12732/ijam.v32i6.3openalex-snapshot
EMBEDDING OF COMPLETE MULTIPARTITE GRAPHS INTO CYCLE-OF-LADDERS
inferred← citeshttps://doi.org/10.14419/ijet.v7i3.12603openalex-snapshot
Monophonic Wirelength in Graph Embedding
inferred← citeshttps://doi.org/10.1504/ijnvo.2017.10004169openalex-snapshot
Embedding complete bipartite graph into grid with optimum congestion and wirelength
inferred← citeshttps://doi.org/10.1504/ijnvo.2017.10004171openalex-snapshot
Exact wirelength of embedding chord graph into tree-based architectures
inferred← citeshttps://doi.org/10.22052/ijmc.2012.5236openalex-snapshot
WIENER, SZEGED AND VERTEX PI INDICES OF REGULAR TESSELLATIONS
inferred← citeshttps://doi.org/10.3390/math11071711openalex-snapshot
On Optimal Embeddings in 3-Ary n-Cubes
inferred← citeshttps://doi.org/10.48550/arxiv.1902.03391openalex-snapshot
Embedding onto Wheel-like Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1910.10643openalex-snapshot
Embedding Complete Multipartite Graphs into Certain Trees
inferred← citeshttps://doi.org/10.5120/9950-4597openalex-snapshot
Embedding of C_n^2 and C_(n-1)^2+K_1 in to Arbitrary Tree
inferred← citeshttps://doi.org/10.5121/jgraphoc.2012.4402openalex-snapshot
Embedding of Poly Honeycomb Networks and the Metric dimension of Star of David Network
inferred← citeshttps://doi.org/10.5614/ejgta.2021.9.2.21openalex-snapshot
Embedding complete multi-partite graphs into Cartesian product of paths and cycles
inferred← citeshttps://doi.org/10.61186/ijmsi.18.2.185openalex-snapshot
Embedding Wheel - like Networks
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.