On the number of labeled outerplanar \(k\)-cycle blocks

DOI10.1515/dma-2017-0040zbMath1385.05066OpenAlexW2775569613MaRDI QIDQ1744336

Vitaliy A. Voblyi

Publication date: 23 April 2018

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0040

zbMATH Keywords

blockenumerationouterplanar graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Analytic combinatorics of non-crossing configurations
• Correction to: ``Testing convexity of the generalised hazard function
• Enumeration and limit laws for series-parallel graphs
• Generating Outerplanar Graphs Uniformly at Random
• Unnamed Item

This page was built for publication: On the number of labeled outerplanar \(k\)-cycle blocks