✦ LIBER ✦

Blocks ink-connected graphs

✍ Scribed by D. V. Karpov

Book ID: 106433584
Publisher: Springer US
Year: 2005
Tongue: English
Weight: 319 KB
Volume: 126
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-005-0084-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cliques ink-connected graphs

✍ S. A. Obraztsova 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 138 KB

Generalized flowers ink-connected graphs

✍ A. Glazman 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 392 KB

Contractible Cliques ink-Connected Graph

Contractible Cliques ink-Connected Graphs

✍ Xiaolong Huang; Zemin Jin; Xingxing Yu; Xiaoyan Zhang 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 140 KB

Contractible Small Subgraphs ink-connect

Contractible Small Subgraphs ink-connected Graphs

✍ Shinya Fujita; Ken-ichi Kawarabayashi 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 198 KB

On connected factors inK1,3-free graphs

✍ Li Guojun; Giu Zhenhong 📂 Article 📅 1998 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 276 KB

The number of connected sparsely edged g

The number of connected sparsely edged graphs. II. Smooth graphs and blocks

✍ E. M. Wright 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

A smooth graph is a connected graph without endpoints; f (n, q ) is the number of connected graphs, v(n, q ) is the number of smooth graphs, and u(n, q) is the number of blocks on n labeled points and q edges: wk, V,, and u k are the exponential generating functions of f(n, n + k ) , v(n, n + k). an