A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components
Open Access
- 1 January 2008
- journal article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 15 (1) , R148
Abstract
Tutte has described in the book "Connectivity in graphs" a canonical decomposition of any graph into 3-connected components. In this article we translate (using the language of symbolic combinatorics) Tutte's decomposition into a general grammar expressing any family ${\cal G}$ of graphs (with some stability conditions) in terms of the subfamily ${\cal G}_3$ of graphs in ${\cal G}$ that are 3-connected (until now, such a general grammar was only known for the decomposition into $2$-connected components). As a byproduct, our grammar yields an explicit system of equations to express the series counting a (labelled) family of graphs in terms of the series counting the subfamily of $3$-connected graphs. A key ingredient we use is an extension of the so-called dissymmetry theorem, which yields negative signs in the grammar and associated equation system, but has the considerable advantage of avoiding the difficult integration steps that appear with other approaches, in particular in recent work by Giménez and Noy on counting planar graphs. As a main application we recover in a purely combinatorial way the analytic expression found by Giménez and Noy for the series counting labelled planar graphs (such an expression is crucial to do asymptotic enumeration and to obtain limit laws of various parameters on random planar graphs). Besides the grammar, an important ingredient of our method is a recent bijective construction of planar maps by Bouttier, Di Francesco and Guitter. Finally, our grammar applies also to the case of unlabelled structures, since the dissymetry theorem takes symmetries into account. Even if there are still difficulties in counting unlabelled 3-connected planar graphs, we think that our grammar is a promising tool toward the asymptotic enumeration of unlabelled planar graphs, since it circumvents some difficult integral calculations.
Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Asymptotic enumeration and limit laws of planar graphsJournal of the American Mathematical Society, 2008
- Enumeration and limit laws for series–parallel graphsEuropean Journal of Combinatorics, 2007
- Generating labeled planar graphs uniformly at randomTheoretical Computer Science, 2007
- Random cubic planar graphsRandom Structures & Algorithms, 2006
- Random planar graphsJournal of Combinatorial Theory, Series B, 2005
- Combinatorial Species and Tree-like Structures1997
- Counting unlabelled three-connected and homeomorphically irreducible two-connected graphsJournal of Combinatorial Theory, Series B, 1982
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Enumeration of non-separable graphsJournal of Combinatorial Theory, 1970
- The enumeration of c-nets via quadrangulationsJournal of Combinatorial Theory, 1968