✦ LIBER ✦

The structure of a decomposition of a triconnected graph

✍ Scribed by D. V. Karpov, A. V. Pastor

Book ID: 113072927
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 571 KB
Volume: 184
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-012-0885-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A plane graph representation of triconne

A plane graph representation of triconnected graphs

✍ Shunsuke Ota; Ehab Morsy; Hiroshi Nagamochi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 728 KB

A V log V algorithm for isomorphism of t

A V log V algorithm for isomorphism of triconnected planar graphs

✍ J.E. Hopcroft; R.E. Tarjan 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 476 KB

An algorithm for determining whether two triconnected planar graphs are isomorphic is presented. The asymptotic growth rate of the algorithm is bounded by a constant times ! V ! log I V [ where I V I is the number of vertices in the graphs.

3K2-decomposition of a graph

✍ A. Bialostocki; Y. Roditty 📂 Article 📅 1982 🏛 Akadmiai Kiad 🌐 English ⚖ 338 KB

The greedy clique decomposition of a gra

The greedy clique decomposition of a graph

✍ Sean McGuinness 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract We prove that if maximal cliques are removed one by one from any graph with __n__ vertices, then the graph will be empty after at most __n__^2^/4 steps. This proves a conjecture of Winkler.

On the decomposition of a graph into sta

On the decomposition of a graph into stars

✍ Michael Tarsi 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 248 KB

It is known that whenever u(u -1) -0 (mod 2m) and u ~=2tn, the complete graph K, can be decomposed into edge disjoint, m-stars [l, 21. In this paper we prove that K, can be

A decomposition of a graph into dense su

A decomposition of a graph into dense subgraphs

✍ Toida, S. 📂 Article 📅 1985 🏛 IEEE ⚖ 811 KB