Decomposition of the Kneser Graph into paths of length four

Necessary and sufficient conditions are given for the existence of a graph decomposition of the Kneser Graph KGn,2 into paths of length four.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 338; no. 8; pp. 1284 - 1288
Main Authors Whitt, T.R., Rodger, C.A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 06.08.2015
Subjects
Graph decomposition
Kneser Graph
Path decomposition
Kneser Graph
Graph decomposition
Path decomposition
Online AccessGet full text

Cover

More Information
Summary:Necessary and sufficient conditions are given for the existence of a graph decomposition of the Kneser Graph KGn,2 into paths of length four.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2015.02.011