Premium
Decompositions of a complete multidigraph into nonhamiltonian paths
Author(s) -
Meszka Mariusz,
Skupień Zdzisław
Publication year - 2006
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.20122
Subject(s) - mathematics , combinatorics , vertex (graph theory) , multiplicity (mathematics) , graph , discrete mathematics , graph theory , geometry
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom