Scaling limit of graph classes through split decomposition

MaRDI QIDQ6913075zbMATH OpenFDO

Authors Frédérique Bassino, Mathilde Bouvel, Valentin Féray, L. Gerin, Adeline Pierrot

Publication date 21 October 2025

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://ajc.maths.uq.edu.au/pdf/92/ajc_v92_p266.pdf

zbMATH Keywords

distance-hereditary graphs2-connected distance-hereditary graphs3-leaf power graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites work

• A decorated tree approach to random permutations in substitution-closed classes
• An exact enumeration of distance-hereditary graphs
• Analytic combinatorics
• Asymptotic study of subcritical graph classes
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Computing maximum stable sets for distance-hereditary graphs
• Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
• Decomposition of Directed Graphs
• Enumerations, forbidden subgraph characterizations, and the split-decomposition
• Equivalence of Gromov-Prohorov- and Gromov's \(\underline{\square}_\lambda\)-metric on the space of metric measure spaces
• Extremal Parameters in Sub-Critical Graph Classes
• Graph Classes: A Survey
• Graphon convergence of random cographs
• Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees
• Invariance principles for spatial multitype Galton-Watson trees
• Largest component in random combinatorial structures
• Random Trees
• Random cographs: Brownian graphon limit and asymptotic degree distribution
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• Random trees and applications
• Scaling limit of random planar quadrangulations with a boundary
• Scaling limits of permutation classes with a finite specification: a dichotomy
• Scaling limits of random graphs from subcritical classes
• Scaling limits of random planar maps with a unique large face
• Some families of increasing planar maps
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
• Tessellations of random maps of arbitrary genus
• The Brownian limit of separable permutations
• The CRT is the scaling limit of random dissections
• The continuum random tree. III
• The gap between Gromov-Vague and Gromov-Hausdorff-vague topology
• The golf model on \(\mathbb{Z}/n \mathbb{Z}\) and on \(\mathbb{Z}\)
• The scaling limit of random outerplanar maps
• Universal limits of substitution-closed permutation classes

This page was built for publication: Scaling limit of graph classes through split decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913075)