𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decompositions of a complete multidigraph into nonhamiltonian paths

✍ Scribed by Mariusz Meszka; Zdzisław Skupień

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
116 KB
Volume
51
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

For n ≥ 3, the complete n‐vertex multidigraph with any fixed multiplicity of edges is proved to be decomposable into nonhamiltonian (directed) paths of arbitrarily prescribed lengths (≤ n − 2) provided that the lengths sum up to the size of the multidigraph. © 2005 Wiley Periodicals, Inc. J Graph Theory

📜 SIMILAR VOLUMES

Decompositions of highly connected graph
Decompositions of highly connected graphs into paths of length 3
✍ Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

## Abstract We prove that a 171‐edge‐connected graph has an edge‐decomposition into paths of length 3 if and only its size is divisible by 3. It is a long‐standing problem whether 2‐edge‐connectedness is sufficient for planar triangle‐free graphs, and whether 3‐edge‐connectedness suffices for graph

Decompositions of complete graphs into r
Decompositions of complete graphs into regular bichromatic factors
✍ Anton Kotzig 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 517 KB

The proof of the following theorem is given: A complete graph with n vertkes can he decomposed into r regular bichromatic factors if and only if n is even and greater thl;iirl 4 and there exists $1 natural number k with the properties that k < r anu. ak-l < n 5 Zk.

Decompositions of complete graphs into r
Decompositions of complete graphs into regular bichromatic factors
✍ Anton Kotzig 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Abstxact. The purpose of this paper is to find iI nccessar) and sufficient condition fltr the euis-trn~~ of ;L decoillposi!ion of a ~omplcte graph with given number of vc;tices into regular bichro-ma% ticfor ;uld v.1 artswcr thy' question what is the possible number of factors in such a de-c~?rnp~~i