On the Existence of Specified Cycles in Complementary Graphs.
Abstract
Let c(m,n) be the least integer p such that for any graph G of order p, either G has an m-cycle or its complement G bar has an n-cycle. Values of c(m,n) are established for m,n = or < 6 and general formulas are presented for c(3,n), c(4,n), and c(5,n). (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1971
- Accession Number
- AD0729003
Entities
People
- Gary Chartrand
- Seymour Schuster
Organizations
- University of California, Santa Barbara