Premium
On one‐factorizations of compositions of graphs
Author(s) -
Himelwright P.,
Wailis W. D.,
Williamson J. E.
Publication year - 1984
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.3190080122
Subject(s) - citation , computer science , combinatorics , library science , sociology , mathematics
Let G[H] denote the composition of the graphs G and H. If G can be decomposed into one-factors and two-factors, H can be decomposed into one-factors, and H is not the empty graph on an odd number of vertices, then G[H] can be decomposed into one-factors.