|
|||||
|
|
Two sufficient conditions for dominating cycles |
|
| Authors: | Mei Lu Huiqing Liu Feng Tian |
| Abstract: | A cycle C of a graph G is dominating if each component of  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 |
| Keywords: | dominating cycle connectivity insertible vertex |