Face-width of embedded graphs
Bojan Mohar (1997)
Mathematica Slovaca
Similarity:
Displaying similar documents to “Asymptotic enumeration of labelled graphs by genus.”
Face-width of embedded graphs
The number of labeled 2-connected planar graphs.
Bender, Edward A., Gao, Zhicheng, Wormald, Nicholas C. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Enumeration and asymptotic properties of unlabeled outerplanar graphs.
Bodirsky, Manuel, Fusy, Eric, Kang, Mihyun, Vigerske, Stefan (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Certain cubic multigraphs and their upper embeddability
Ladislav Nebeský (1995)
Czechoslovak Mathematical Journal
Similarity:
Map genus, forbidden maps, and monadic second-order logic.
Courcelle, B., Dussaux, V. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A complete grammar for decomposing a family of graphs into 3-connected components.
Chapuy, Guillaume, Fusy, Éric, Kang, Mihyun, Shoilekova, Bilyana (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of graphs not containing as a minor.
Gerke, Stefanie, Giménez, Omer, Noy, Marc, Weißl, Andreas (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the connectivity of graphs embedded in surfaces. II.
Plummer, Michael D., Zha, Xiaoya (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of cycles in -connected graphs.
Knor, M. (1994)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: