Extremal Parameters in Sub-Critical Graph Classes

DOI10.1137/1.9781611973037.1zbMath1430.05059OpenAlexW4213260139MaRDI QIDQ5194732

Marc Noy, Michael Drmota

Publication date: 17 September 2019

Published in: 2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973037.1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (10)

Maximum degree in minor-closed classes of graphs ⋮ Random enriched trees with applications to random graphs ⋮ Asymptotic properties of random unlabelled block-weighted graphs ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023 ⋮ Limits of random tree-like discrete structures ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Random graphs from a block-stable class ⋮ Expected Maximum Block Size in Critical Random Graphs ⋮ Spanning trees in random series-parallel graphs

This page was built for publication: Extremal Parameters in Sub-Critical Graph Classes