Premium
Partitioning oriented 2‐paths
Author(s) -
Heinrich Katherine
Publication year - 1983
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190070308
Subject(s) - combinatorics , mathematics , graph , discrete mathematics
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.