𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitioning oriented 2-paths

✍ Scribed by Katherine Heinrich

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
433 KB
Volume
7
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

There are three types of oriented 2‐paths. Necessary and sufficient conditions are given under which all oriented 2‐paths of the same type and with vertices labeled 1, 2,…., n can be partitioned into copies of the complete symmetric directed graph with n vertices.

πŸ“œ SIMILAR VOLUMES

Homomorphisms to oriented paths
Homomorphisms to oriented paths
✍ Pavol Hell; Xuding Zhu πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 523 KB
Hamiltonian paths in oriented graphs
Hamiltonian paths in oriented graphs
✍ Maria Overbeck-Larisch πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 217 KB
Gibbon travel paths are goal oriented
Gibbon travel paths are goal oriented
✍ Asensio, Norberto; Brockelman, Warren Y.; Malaivijitnond, Suchinda; Reichard, Ul πŸ“‚ Article πŸ“… 2011 πŸ› Springer-Verlag 🌐 English βš– 304 KB
k-Path partitions in trees
k-Path partitions in trees
✍ Jing-Ho Yan; Gerard J. Chang; Sandra M. Hedetniemi; stephen T. Hedetniemi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 437 KB

For a fixed positive integer k, the k-path partition problem is to partition the vertex set of a graph into the smallest number of paths such that each path has at most k vertices. The 2path partition problem is equivalent to the edge-cover problem. This paper presents a linear-time algorithm for th