✦ LIBER ✦

A note on the cyclical edge-connectivity of fullerene graphs

✍ Scribed by Zhongbin Qi; Heping Zhang

Publisher: Springer
Year: 2007
Tongue: English
Weight: 143 KB
Volume: 43
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-006-9185-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the edge-connectivity vector of a gra

On the edge-connectivity vector of a graph

✍ Linda M. Lesniak; Raymond E. Pippert 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

A note on the connectivity of Kronecker

A note on the connectivity of Kronecker products of graphs

✍ Raxida Guji; Elkin Vumar 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Let κ(G) be the connectivity of G. The Kronecker product where G is a bipartite graph.

On the Edge Connectivity, Hamiltonicity,

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs

✍ Jan van den Heuvel; Bill Jackson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GÂE(F ) is

On partitioning the edges of graphs into

On partitioning the edges of graphs into connected subgraphs

✍ M. Jünger; G. Reinelt; W. R. Pulleyblank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 559 KB

For any positive integer s, an s-partition of a graph G = ( ! -( €I is a partition of E into El U E2 U U E k, where 14 = s for 1 I i 5 k -1 and 1 5 1 4 1 5 s and each €; induces a connected subgraph of G. We prove (i) if G is connected, then there exists a 2-partition, but not neces-(ii) if G is 2-e

Super Connectivity and Super Edge Connec

Super Connectivity and Super Edge Connectivity of the Mycielskian of a Graph

✍ Litao Guo; Ruifang Liu; Xiaofeng Guo 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 115 KB

Covering the Edges of a Connected Graph

Covering the Edges of a Connected Graph by Paths

✍ L. Pyber 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We prove that every connected graph on n vertices can be covered by at most nÂ2+O(n 3Â4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.