Decompositions of nearly complete digraphs into t isomorphic parts
Discussiones Mathematicae. Graph Theory, Tome 29 (2009) no. 3, pp. 563-572
Voir la notice de l'article provenant de la source Library of Science
An arc decomposition of the complete digraph Kₙ into t isomorphic subdigraphs is generalized to the case where the numerical divisibility condition is not satisfied. Two sets of nearly tth parts are constructively proved to be nonempty. These are the floor tth class ( Kₙ-R)/t and the ceiling tth class ( Kₙ+S)/t, where R and S comprise (possibly copies of) arcs whose number is the smallest possible. The existence of cyclically 1-generated decompositions of Kₙ into cycles ^→C_n-1 and into paths ^→Pₙ is characterized.
Keywords:
decomposition, cyclically 1-generated, remainder, surplus, universal part
@article{DMGT_2009_29_3_a7,
author = {Meszka, Mariusz and Skupie\'n, Zdzis{\l}aw},
title = {Decompositions of nearly complete digraphs into t isomorphic parts},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {563--572},
publisher = {mathdoc},
volume = {29},
number = {3},
year = {2009},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2009_29_3_a7/}
}
TY - JOUR AU - Meszka, Mariusz AU - Skupień, Zdzisław TI - Decompositions of nearly complete digraphs into t isomorphic parts JO - Discussiones Mathematicae. Graph Theory PY - 2009 SP - 563 EP - 572 VL - 29 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2009_29_3_a7/ LA - en ID - DMGT_2009_29_3_a7 ER -
Meszka, Mariusz; Skupień, Zdzisław. Decompositions of nearly complete digraphs into t isomorphic parts. Discussiones Mathematicae. Graph Theory, Tome 29 (2009) no. 3, pp. 563-572. http://geodesic.mathdoc.fr/item/DMGT_2009_29_3_a7/