A complete grammar for decomposing a family of graphs into 3-connected components.

Chapuy, Guillaume, et al. "A complete grammar for decomposing a family of graphs into 3-connected components.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R148, 39 p.-Research Paper R148, 39 p.. <http://eudml.org/doc/117283>.

@article{Chapuy2008,
author = {Chapuy, Guillaume, Fusy, Éric, Kang, Mihyun, Shoilekova, Bilyana},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {graph decomposition; 3-connected components; symbolic combinatorics; grammar; family of graphs; subfamily of graphs; dissymmetry theorem; series counting labellled planar graphs; asymptotic enumeration; unlabelled planar graphs; bijective construction of planar graphs;; bijective construction of planar graphs},
language = {eng},
number = {1},
pages = {Research Paper R148, 39 p.-Research Paper R148, 39 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A complete grammar for decomposing a family of graphs into 3-connected components.},
url = {http://eudml.org/doc/117283},
volume = {15},
year = {2008},
}

TY - JOUR
AU - Chapuy, Guillaume
AU - Fusy, Éric
AU - Kang, Mihyun
AU - Shoilekova, Bilyana
TI - A complete grammar for decomposing a family of graphs into 3-connected components.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R148, 39 p.
EP - Research Paper R148, 39 p.
LA - eng
KW - graph decomposition; 3-connected components; symbolic combinatorics; grammar; family of graphs; subfamily of graphs; dissymmetry theorem; series counting labellled planar graphs; asymptotic enumeration; unlabelled planar graphs; bijective construction of planar graphs;; bijective construction of planar graphs
UR - http://eudml.org/doc/117283
ER -