Scholarlink

<p>A <i>k</i>-cactus is a connected graph in which each edge is contained in a maximum of <i>k</i> cycles. We obtain exact and asymptotic formulas for the number of labeled Eulerian 3-cacti with a given number of vertices.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

ENUMERATION OF LABELED EULERIAN 3-CACTI

  • 期刊论文

  • 发表日期：

    2025年10月1日

查看全文
  • V. A. Voblyi

摘要

A k-cactus is a connected graph in which each edge is contained in a maximum of k cycles. We obtain exact and asymptotic formulas for the number of labeled Eulerian 3-cacti with a given number of vertices.