A Note on Packing Graphs Without Cycles of Length up to Five
Abstract
The following statement was conjectured by Faudree, Rousseau, Schelp and Schuster: if a graph $G$ is a non-star graph without cycles of length $m \leq 4$ then $G$ is a subgraph of its complement. So far the best result concerning this conjecture is that every non-star graph $G$ without cycles of length $m \leq 6$ is a subgraph of its complement. In this note we show that $m\leq 6$ can be replaced by $m \leq 5$.
Published
2009-10-26
How to Cite
Görlich, A., & Żak, A. (2009). A Note on Packing Graphs Without Cycles of Length up to Five. The Electronic Journal of Combinatorics, 16(1), N30. https://doi.org/10.37236/268
Article Number
N30