On the public citation graph
Adjacency Labelling for Planar Graphs (and Beyond)
0 signed · 49 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.1007/978-3-662-43951-7_32openalex-snapshot
Labeling Schemes for Bounded Degree Graphs
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/s00039-017-0396-9openalex-snapshot
Asymptotically optimal induced universal graphs
inferredcites →https://doi.org/10.1016/j.cosrev.2017.06.002openalex-snapshot
An annotated bibliography on 1-planarity
inferredcites →https://doi.org/10.1016/j.jctb.2006.01.006openalex-snapshot
Proper minor-closed families are small
inferredcites →https://doi.org/10.1016/s0167-5060(08)70644-7openalex-snapshot
Optimal Embedding of a Tree into an Interval Graph in Linear Time
inferredcites →https://doi.org/10.1017/s0963548321000213openalex-snapshot
Clustered 3-colouring graphs of bounded degree
inferredcites →https://doi.org/10.1090/s0894-0347-08-00624-3openalex-snapshot
Asymptotic enumeration and limit laws of planar graphs
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1137/1.9781611974331.ch25openalex-snapshot
Simpler, faster and shorter labels for distances in graphs
inferredcites →https://doi.org/10.1137/16m1105967openalex-snapshot
Adjacency Labeling Schemes and Induced-Universal Graphs
inferredcites →https://doi.org/10.1145/1060590.1060666openalex-snapshot
Edge partition of planar sraphs into two outerplanar graphs
inferredcites →https://doi.org/10.1145/3088513openalex-snapshot
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
inferredcites →https://doi.org/10.1145/3385731openalex-snapshot
Planar Graphs Have Bounded Queue-Number
inferredcites →https://doi.org/10.1145/3459637.3482117openalex-snapshot
Graph Structure Aware Contrastive Knowledge Distillation for Incremental Learning in Recommender Systems
inferredcites →https://doi.org/10.1145/62212.62244openalex-snapshot
Implicit representation of graphs
inferredcites →https://doi.org/10.5555/545381.545504openalex-snapshot
Improved labeling scheme for ancestor queries
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.23023openalex-snapshot
Structural properties of graph products
inferred← citeshttps://doi.org/10.1007/978-3-031-47417-0_9openalex-snapshot
Product Structure of Graph Classes with Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_24openalex-snapshot
Labeling Embeddings of Planar Graphs for Face-Adjacency
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_1openalex-snapshot
Graph Product Structure Theory with Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_5openalex-snapshot
Subgraph-Universal Planar Graphs for Trees
inferred← citeshttps://doi.org/10.1007/s00493-025-00168-wopenalex-snapshot
The Grid-Minor Theorem Revisited
inferred← citeshttps://doi.org/10.1007/s11856-025-2747-9openalex-snapshot
Universal families of arcs and curves on surfaces
inferred← citeshttps://doi.org/10.1016/j.chaos.2024.115486openalex-snapshot
Type-II Apollonian network: More robust and more efficient Apollonian network
inferred← citeshttps://doi.org/10.1016/j.chaos.2025.117318openalex-snapshot
Maximal planar networks with exponential degree distribution
inferred← citeshttps://doi.org/10.1016/j.dam.2022.10.004openalex-snapshot
Local certification of graphs with bounded genus
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114697openalex-snapshot
The r-dynamic chromatic number is bounded in the strong 2-coloring number
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.03.004openalex-snapshot
Graph product structure for non-minor-closed classes
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.281openalex-snapshot
Lower Bounds for Induced-Universal Graphs
inferred← citeshttps://doi.org/10.1017/s0963548323000457openalex-snapshot
Product structure of graph classes with bounded treewidth
inferred← citeshttps://doi.org/10.1090/btran/192openalex-snapshot
Product structure of graphs with an excluded minor
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00109openalex-snapshot
The Implicit Graph Conjecture is False
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00116openalex-snapshot
Proof of the Clustered Hadwiger Conjecture
inferred← citeshttps://doi.org/10.1112/jlms.12781openalex-snapshot
Sparse universal graphs for planarity
inferred← citeshttps://doi.org/10.1137/1.9781611975994.27openalex-snapshot
Shorter Labeling Schemes for Planar Graphs
inferred← citeshttps://doi.org/10.1137/22m1540296openalex-snapshot
Shallow Minors, Graph Products, and Beyond-Planar Graphs
inferred← citeshttps://doi.org/10.1137/23m1618661openalex-snapshot
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
inferred← citeshttps://doi.org/10.1145/3519935.3519978openalex-snapshot
Randomized communication and implicit graph representations
inferred← citeshttps://doi.org/10.46298/dmtcs.8877openalex-snapshot
Improved product structure for graphs on surfaces
inferred← citeshttps://doi.org/10.5802/igt.10openalex-snapshot
Product Structure of Graph Classes with Strongly Sublinear Separators
inferred← citeshttps://doi.org/10.5802/igt.4openalex-snapshot
Powers of planar graphs, product structure, and blocking partitions
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-049openalex-snapshot
Powers of planar graphs, product structure, and blocking partitions
inferred← citeshttps://doi.org/10.70675/24a1677azd431z4e3az9aedzdc6c7cde72e3openalex-snapshot
Embedded graphs : crossings and decompositions
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.