About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Discrete Mathematics
Paper
A factorization theorem for a certain class of graphs
Abstract
In this note we give a necessary and sufficient condition for factorization of graphs satisfying the "odd cycle property". We show that a graph G with the odd cycle property contains a [ki] factor if and only if the sequence [H]+[ki] is graphical for all subgraphs H of the complement of G. A similar theorem is shown to be true for all digraphs. © 1974.