Two sufficient conditions for dominating cycles

  1. Mei Lu1,
  2. Huiqing Liu2,
  3. Feng Tian2

Article first published online: 18 MAR 2005

DOI: 10.1002/jgt.20070

Issue

Journal of Graph Theory

Journal of Graph Theory

Volume 49, Issue 2, pages 135–150, June 2005

Additional Information

How to Cite

Lu, M., Liu, H. and Tian, F. (2005), Two sufficient conditions for dominating cycles. Journal of Graph Theory, 49: 135–150. doi: 10.1002/jgt.20070

Author Information

  1. 1

    Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China

  2. 2

    Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China

Publication History

  1. Issue published online: 29 MAR 2005
  2. Article first published online: 18 MAR 2005
  3. Manuscript Revised: 31 AUG 2004
  4. Manuscript Received: 8 APR 2002

Funded by

  • NNSFC (to M.L.). Grant Number: 60172005
  • NNSFC

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (148K)

Keywords:

  • dominating cycle;
  • connectivity;
  • insertible vertex

Abstract

A cycle C of a graph G is dominating if each component of equation image 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

Get PDF (148K)