On the public citation graph

Universal Graphs for Bounded-Degree Trees and Planar Graphs

https://doi.org/10.1137/0402014

0 signed · 88 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.1007/3-540-10291-4_12openalex-snapshot

Issues in the study of graph embeddings

inferredcites →https://doi.org/10.1007/bf02126799openalex-snapshot

Ramanujan graphs

inferredcites →https://doi.org/10.1007/bf02579202openalex-snapshot

Expanding graphs contain all small trees

inferredcites →https://doi.org/10.1016/0012-365x(88)90189-6openalex-snapshot

Explicit construction of linear sized tolerant networks

inferredcites →https://doi.org/10.1016/0022-0000(84)90071-0openalex-snapshot

A framework for solving VLSI graph layout problems

inferredcites →https://doi.org/10.1016/0095-8956(71)90016-5openalex-snapshot

Pancyclic graphs I

inferredcites →https://doi.org/10.1016/0095-8956(78)90072-2openalex-snapshot

On graphs which contain all small trees

inferredcites →https://doi.org/10.1016/0095-8956(81)90037-xopenalex-snapshot

Universal caterpillars

inferredcites →https://doi.org/10.1016/0304-3975(80)90043-2openalex-snapshot

Uniform data encodings

inferredcites →https://doi.org/10.1016/s0304-0208(08)73486-8openalex-snapshot

On Graphs Which Contain All Sparse Graphs

inferredcites →https://doi.org/10.1017/s2040618500035139openalex-snapshot

On minimal n-universal graphs

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

Optimal simulations of tree machines

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

Universality considerations in VLSI circuits

inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb32784.xopenalex-snapshot

ON UNIVERSAL GRAPHS

inferredcites →https://doi.org/10.1112/jlms/s2-27.2.203openalex-snapshot

On Universal Graphs for Spanning Trees

inferredcites →https://doi.org/10.1137/0136016openalex-snapshot

A Separator Theorem for Planar Graphs

inferredcites →https://doi.org/10.1137/0604055openalex-snapshot

Perfect Storage Representations for Families of Data Structures

inferredcites →https://doi.org/10.1145/2157.322401openalex-snapshot

Cost Trade-offs in Graph Embeddings, with Applications

inferredcites →https://doi.org/10.1145/62212.62229openalex-snapshot

Optimal simulations by Butterfly Networks

inferredcites →https://doi.org/10.4064/aa-9-4-331-340openalex-snapshot

Universal graphs and universal functions

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.3190140408openalex-snapshot

Universal graphs and induced‐universal graphs

inferred← citeshttps://doi.org/10.1002/rsa.20143openalex-snapshot

Sparse universal graphs for bounded‐degree graphs

inferred← citeshttps://doi.org/10.1002/rsa.20337openalex-snapshot

Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$

inferred← citeshttps://doi.org/10.1002/rsa.20545openalex-snapshot

An improved upper bound on the density of universal random graphs

inferred← citeshttps://doi.org/10.1002/rsa.20596openalex-snapshot

Universality of random graphs and rainbow embedding

inferred← citeshttps://doi.org/10.1002/rsa.20661openalex-snapshot

Almost‐spanning universality in random graphs

inferred← citeshttps://doi.org/10.1002/rsa.70055openalex-snapshot

Universality for Graphs of Bounded Degeneracy

inferred← citeshttps://doi.org/10.1002/rsa.70059openalex-snapshot

Size‐Ramsey Numbers of Structurally Sparse Graphs

inferred← citeshttps://doi.org/10.1006/jctb.1995.1057openalex-snapshot

Decomposing a Planar Graph into Degenerate Graphs

inferred← citeshttps://doi.org/10.1007/3-540-44666-4_20openalex-snapshot

Near-optimum Universal Graphs for Graphs with Bounded Degrees

inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_14openalex-snapshot

Universal Geometric Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_125openalex-snapshot

c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories

inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8_1openalex-snapshot

Universality, Tolerance, Chaos and Order

inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_20openalex-snapshot

An Improved Upper Bound on the Density of Universal Random Graphs

inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_32openalex-snapshot

Labeling Schemes for Bounded Degree Graphs

inferred← citeshttps://doi.org/10.1007/bf01187092openalex-snapshot

An approach to emulating separable graphs

inferred← citeshttps://doi.org/10.1007/bf02090404openalex-snapshot

Routing multiple paths in hypercubes

inferred← citeshttps://doi.org/10.1007/s00373-009-0860-xopenalex-snapshot

Induced-Universal Graphs for Graphs with Bounded Maximum Degree

inferred← citeshttps://doi.org/10.1007/s00493-007-2182-zopenalex-snapshot

Embedding nearly-spanning bounded degree trees

inferred← citeshttps://doi.org/10.1007/s00493-010-2422-5openalex-snapshot

A randomized embedding algorithm for trees

inferred← citeshttps://doi.org/10.1007/s004930200017openalex-snapshot

Small Universal Graphs for Bounded-Degree Planar Graphs

inferred← citeshttps://doi.org/10.1007/s10878-017-0214-1openalex-snapshot

Sparse multipartite graphs as partition universal for graphs with bounded degree

inferred← citeshttps://doi.org/10.1016/j.dam.2024.11.008openalex-snapshot

A note on universal graphs for spanning trees

inferred← citeshttps://doi.org/10.1016/j.ejc.2009.10.010openalex-snapshot

Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs

inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.017openalex-snapshot

On Universal Graphs of Minor Closed Families

inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.030openalex-snapshot

Almost-spanning universality in random graphs (Extended abstract)

inferred← citeshttps://doi.org/10.1016/j.ipl.2008.04.020openalex-snapshot

On induced-universal graphs for the class of bounded-degree graphs

inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00455-1openalex-snapshot

Sparse universal graphs

inferred← citeshttps://doi.org/10.1017/9781108332699.003openalex-snapshot

Large-scale structures in random graphs

inferred← citeshttps://doi.org/10.1017/s096354830000122xopenalex-snapshot

On Universal Threshold Graphs

inferred← citeshttps://doi.org/10.1017/s0963548312000533openalex-snapshot

Expanders Are Universal for the Class of All Spanning Trees

inferred← citeshttps://doi.org/10.1017/s0963548313000151openalex-snapshot

Size Ramsey Number of Bounded Degree Graphs for Games

inferred← citeshttps://doi.org/10.1017/s0963548321000110openalex-snapshot

Universal and unavoidable graphs

inferred← citeshttps://doi.org/10.1017/s0963548323000135openalex-snapshot

Universal geometric graphs

inferred← citeshttps://doi.org/10.1090/tran/7727openalex-snapshot

Optimal threshold for a random graph to be 2-universal

inferred← citeshttps://doi.org/10.1109/focs.2015.84openalex-snapshot

Optimal Induced Universal Graphs and Adjacency Labeling for Trees

inferred← citeshttps://doi.org/10.1109/focs54457.2022.00109openalex-snapshot

The Implicit Graph Conjecture is False

inferred← citeshttps://doi.org/10.1109/iscas.1991.176570openalex-snapshot

Universal graphs for 2-paths

inferred← citeshttps://doi.org/10.1109/sfcs.2000.892007openalex-snapshot

Universality and tolerance

inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181882openalex-snapshot

Small induced-universal graphs and compact implicit graph representations

inferred← citeshttps://doi.org/10.1109/tpds.2007.1024openalex-snapshot

Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories

inferred← citeshttps://doi.org/10.1112/jlms.12781openalex-snapshot

Sparse universal graphs for planarity

inferred← citeshttps://doi.org/10.1137/0221012openalex-snapshot

Efficient Embeddings of Trees in Hypercubes

inferred← citeshttps://doi.org/10.1137/0405049openalex-snapshot

Implicat Representation of Graphs

inferred← citeshttps://doi.org/10.1137/1.9781611973099.122openalex-snapshot

Expanders Are Universal for the Class of All Spanning Trees (Extended Abstract)

inferred← citeshttps://doi.org/10.1137/10079882xopenalex-snapshot

Universality of Random Graphs

inferred← citeshttps://doi.org/10.1137/130942437openalex-snapshot

Universality of Random Graphs for Graphs of Maximum Degree Two

inferred← citeshttps://doi.org/10.1137/140982842openalex-snapshot

The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition

inferred← citeshttps://doi.org/10.1137/16m1105967openalex-snapshot

Adjacency Labeling Schemes and Induced-Universal Graphs

inferred← citeshttps://doi.org/10.1145/113379.113393openalex-snapshot

Simulating binary trees on X-trees (extended abstract)

inferred← citeshttps://doi.org/10.1145/113379.113394openalex-snapshot

An approach to emulating separable graphs (preliminary version)

inferred← citeshttps://doi.org/10.1145/2746539.2746545openalex-snapshot

Adjacency Labeling Schemes and Induced-Universal Graphs

inferred← citeshttps://doi.org/10.1145/301250.301446openalex-snapshot

Small universal graphs

inferred← citeshttps://doi.org/10.1145/3088513openalex-snapshot

Optimal Induced Universal Graphs and Adjacency Labeling for Trees

inferred← citeshttps://doi.org/10.1145/3385731openalex-snapshot

Planar Graphs Have Bounded Queue-Number

inferred← citeshttps://doi.org/10.1145/97444.97457openalex-snapshot

Routing multiple paths in hypercubes

inferred← citeshttps://doi.org/10.2298/petf0314001mopenalex-snapshot

Antiregular graphs are universal for trees

inferred← citeshttps://doi.org/10.3929/ethz-a-007052734openalex-snapshot

Combinatorial Games on Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.0707.2079openalex-snapshot

Nearly optimal embeddings of trees

inferred← citeshttps://doi.org/10.48550/arxiv.1108.4647openalex-snapshot

Expanders Are Universal for the Class of All Spanning Trees

inferred← citeshttps://doi.org/10.48550/arxiv.1211.3050openalex-snapshot

The approximate Loebl-Komlós-Sós Conjecture

inferred← citeshttps://doi.org/10.48550/arxiv.1310.5873openalex-snapshot

Universality of random graphs for graphs of maximum degree two

inferred← citeshttps://doi.org/10.48550/arxiv.1311.7063openalex-snapshot

Universality of random graphs and rainbow embedding

inferred← citeshttps://doi.org/10.48550/arxiv.1404.0588openalex-snapshot

Labeling Schemes for Bounded Degree Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1411.6966openalex-snapshot

Sparse Multipartite Graphs as Partition Universal for Graphs of Bounded-Degrees

inferred← citeshttps://doi.org/10.48550/arxiv.1502.03971openalex-snapshot

Near-optimal adjacency labeling scheme for power-law graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1503.05612openalex-snapshot

Almost-spanning universality in random graphs

inferred← citeshttps://doi.org/10.48550/arxiv.2109.00327openalex-snapshot

Universality in minor-closed graph classes

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.