✦ LIBER ✦

Petersen Graph Decompositions of Complete Multipartite Graphs

✍ Scribed by Jinhua Wang; Dengju Ma

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 163 KB
Volume: 26
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0925-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fair Hamilton Decompositions of Complete

Fair Hamilton Decompositions of Complete Multipartite Graphs

✍ C.D. Leach; C.A. Rodger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 88 KB

A fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycles in G whose edges partition the edges of G in such a way that, for each pair of parts and for each pair of hamilton cycles H 1 and H 2 , the difference in the number of edges in H 1 and H 2 joining vertices

Decompositions of Complete Multipartite

Decompositions of Complete Multipartite Graphs into Cycles of Even Length

✍ Nicholas J. Cavenagh; Elizabeth J. Billington 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 205 KB

Hamilton decompositions of complete mult

Hamilton decompositions of complete multipartite graphs with any 2-factor leave

✍ C. D. Leach; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB 👁 1 views

## Abstract For __m__ ≥ 1 and __p__ ≥ 2, given a set of integers __s__~1~,…,__s__~__q__~ with $s\_j \geq p+1$ for $1 \leq j \leq q$ and ${\sum \_{j\,=\,1}^q} s\_j = mp$, necessary and sufficient conditions are found for the existence of a hamilton decomposition of the complete __p__‐partite graph $

Critical groups for complete multipartit

Critical groups for complete multipartite graphs and Cartesian products of complete graphs

✍ Brian Jacobson; Andrew Niedermaier; Victor Reiner 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

## Abstract The critical group of a connected graph is a finite abelian group, whose order is the number of spanning trees in the graph, and which is closely related to the graph Laplacian. Its group structure has been determined for relatively few classes of graphs, e.g., complete graphs and compl

The chromatic index of complete multipar

The chromatic index of complete multipartite graphs

✍ D. G. Hoffman; C. A. Rodger 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

## Abstract We show that a complete multipartite graph is class one if and only if it is not eoverfull, thus determining its chromatic index.

On path factorizations of complete multi

On path factorizations of complete multipartite graphs

✍ Min-li Yu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 523 KB

## Necessary conditions for IK(n, r), the complete multipartite graph with r parts of size n in which each edge has multiplicity 1, to have a P,-factorization are nr=O(mod k) and i(r-l)kn=O(mod2(k-1)). We show that when n=O(modk) or r=O(modk), these two conditions are also sufficient. (This impli