Two sufficient conditions for dominating cycles

✍ Scribed by Mei Lu; Huiqing Liu; Feng Tian

• Publisher: John Wiley and Sons
• Year: 2005
• Tongue: English
• Weight: 148 KB
• Volume: 49
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/jgt.20070

✦ Synopsis

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