Two sufficient conditions for dominating cycles
Mei Lu, Huiqing Liu, Feng Tian · Journal of Graph Theory · 2005
Abstract A cycle C of a graph G is dominating if each component of $G\backslash C$ is edgeless. In the paper, we will give two sufficient conditions for each longest cycle of a 3‐connected graph to be a dominating cycle. © 2005 Wiley Periodicals, Inc. J Graph Theory