Notes on Relizations of Sequences by Graphs with Factors.

Abstract

Necessary and sufficient conditions for a pair of sequences to be realized by a bipartite graph without 1-factor are given. It is shown that k phi = (k(a sub 1),...,k(a sub n)) has a realization with a phi-factor, provided k phi and phi are realizable. It is shown that if phi has a realization with a k-factor it is also realizable by a graph having a k-factor which has a l-factor, for l = or < k, l dot n even. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1974
Accession Number
AD0774971

Entities

People

  • Michael Koren

Organizations

  • Cornell University

Tags

DTIC Thesaurus Topics

  • Sequences

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.