Sparse universal graphs for planarity
DOI10.1112/jlms.12781zbMath1527.05041arXiv2010.05779OpenAlexW3092025494MaRDI QIDQ6085077
Gwenaël Joret, Pat Morin, Louis Esperet
Publication date: 2 December 2023
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.05779
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Small universal graphs for bounded-degree planar graphs
- Polynomial bounds for centered colorings on proper minor-closed graph classes
- An improved planar graph product structure theorem
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- Universality considerations in VLSI circuits
- On Graphs Which Contain All Sparse Graphs
- Implicat Representation of Graphs
- On Universal Graphs for Spanning Trees
- Adjacency Labelling for Planar Graphs (and Beyond)
- Planar Graphs Have Bounded Queue-Number
- Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 4th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2001 and 5th international workshop on randomization and approximation techniques in computer science, RANDOM 2001, Berkeley, CA, USA, August 18--20, 2001. Proceedings
- Graph product structure for non-minor-closed classes
