Classes of graphs embeddable in order-dependent surfaces

DOI10.5070/C63160417OpenAlexW3167190130MaRDI QIDQ5886263

Sophia Saller, Colin J. H. McDiarmid

Publication date: 31 March 2023

Published in: Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.06775

zbMATH Keywords

embeddable graphsapproximate countinglabelled graphsorder-dependent surfaces

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of cubic multigraphs on orientable surfaces
• Counting unicellular maps on non-orientable surfaces
• Asymptotic enumeration of labelled graphs by genus
• Random graphs on surfaces
• Small graph classes and bounded expansion
• Enumeration and asymptotic properties of unlabeled outerplanar graphs
• Coefficients of functional compositions often grow smoothly
• Analytic combinatorics of non-crossing configurations
• On random planar graphs, the number of planar graphs and their triangulations
• Evolution of the giant component in graphs on orientable surfaces
• Random planar graphs
• The number of labeled 2-connected planar graphs
• The genus of a random graph
• Asymptotic enumeration and limit laws for graphs of fixed genus
• Proper minor-closed families are small
• Planar graphs, via well-orderly maps and trees
• Counting rooted maps by genus. I
• Graph Theory
• Uniform random sampling of planar graphs in linear time
• Asymptotic enumeration and limit laws of planar graphs
• Random cubic planar graphs
• Graph classes with given 3-connected components: asymptotic counting and critical phenomena
• On the Maximum Degree of a Random Planar Graph
• On the genus of a random graph
• Edge-Maximal Graphs on Surfaces
• The Evolution of Random Graphs on Surfaces
• On the Number of Edges in Random Planar Graphs
• Computing the orientable genus of projective graphs
• The genus of the Erdős‐Rényi random graph and the fragile genus property
• Phase transitions in graphs on orientable surfaces
• Generating Outerplanar Graphs Uniformly at Random
• Elements of Information Theory
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Counting Subgraphs via Homomorphisms

This page was built for publication: Classes of graphs embeddable in order-dependent surfaces