scientific article
From MaRDI portal
Publication:3579480
zbMath1192.05074MaRDI QIDQ3579480
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (12)
Universal and unavoidable graphs ⋮ Almost-spanning universality in random graphs (extended abstract) ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Poisson approximation for non-backtracking random walks ⋮ The size‐Ramsey number of cubic graphs ⋮ Finding any given 2‐factor in sparse pseudorandom graphs efficiently ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ Optimal induced universal graphs for bounded-degree graphs ⋮ Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design ⋮ On universal hypergraphs ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Almost spanning subgraphs of random graphs after adversarial edge removal
This page was built for publication:
