On the Existence of Specified Cycles in Complementary Graphs.
CALIFORNIA UNIV SANTA BARBARA
Pagination or Media Count:
Let cm,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 cm,n are established for m,n or 6 and general formulas are presented for c3,n, c4,n, and c5,n. Author
- Numerical Mathematics