𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex Partitions by Connected Monochromatic k-Regular Graphs

✍ Scribed by Gábor N. Sárközy; Stanley M. Selkow

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
135 KB
Volume
78
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning complete multipartite graph
Partitioning complete multipartite graphs by monochromatic trees
✍ Atsushi Kaneko; M. Kano; Kazuhiro Suzuki 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

The tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t 2 (K (n 1 ; n 2 ; . . . ; n k )) of the c

Circuits through prescribed vertices in
Circuits through prescribed vertices in k-connected k-regular graphs
✍ Roland Häggkvist; Wolfgang Mader 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract We show that every set of $k+\lfloor{1\over 3}\sqrt{k}\rfloor$ vertices in a __k__‐connected __k__‐regular graph belongs to some circuit. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 145–163, 2002

Concept of a vertex in a matroid and 3-c
Concept of a vertex in a matroid and 3-connected graphs
✍ A. K. Kelmans 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract The concept of a matroid vertex is introduced. The vertices of a matroid of a 3‐connected graph are in one‐to‐one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3‐connected graphs implies isomorphism. The concept of a vert

Connectivity of random regular graphs ge
Connectivity of random regular graphs generated by the pegging algorithm
✍ Pu Gao 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract We study the connectivity of random __d__‐regular graphs which are recursively generated by an algorithm motivated by a peer‐to‐peer network. We show that these graphs are asymptotically almost surely __d__‐connected for any even constant __d__⩾4. © 2010 Wiley Periodicals, Inc. J Graph

The square of a connected S(K1,3)-free g
The square of a connected S(K1,3)-free graph is vertex pancyclic
✍ George Hendry; Walter Vogler 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

We prove the conjecture of Gould and Jacobson that a connected S(K1,J free graph has a vertex pancyclic square. Since .S(K1,J is not vertex pancyclic, this result is best possible. ## Our notation generally follows that used in [l] . A graph G is Hamilroniun if it contains a cycle through all its