Cycles through a prescribed vertex set in N-connected graphs

被引：7
|
作者：
Kawarabayashi, K [1 ]
机构：
[1] Princeton Univ, Dept Math, Princeton, NJ 08544 USA
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2004年 / 90卷 / 02期
基金：
日本学术振兴会;
关键词：
cycles; n-connected graphs;
D O I：
10.1016/j.jctb.2003.08.002
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A well-known result of Dirac (Math. Nachr. 22 (1960) 61) says that given n vertices in an n-connected G, G has a cycle through all of them. In this paper, we generalize Dirac's result as follows: Given at most 3/2n vertices in an n-connected graph G when ngreater than or equal to3 and \V(G)\greater than or equal to3/2n, then G has a cycle through exactly n vertices of them. This improves the previous known bound given by Kaneko and Saito (J. Graph Theory 15(6) (1991) 655). (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码：315 / 323
页数：9
相关论文
共 50 条
  • [31] Products of N-connected groups
    Hauck, P
    Martínez-Pastor, A
    Pérez-Ramos, MD
    ILLINOIS JOURNAL OF MATHEMATICS, 2003, 47 (04) : 1033 - 1045
  • [32] PROOF OF SLATER'S CONJECTURE ON k-CRITICAL n-CONNECTED GRAPHS
    苏健基
    Science Bulletin, 1988, (20) : 1675 - 1678
  • [33] Proof of Mader's conjecture on k-critical n-connected graphs
    Su, JJ
    JOURNAL OF GRAPH THEORY, 2004, 45 (04) : 281 - 297
  • [34] LONGEST CYCLES IN 2-CONNECTED GRAPHS WITH PRESCRIBED MAXIMUM DEGREE
    BONDY, JA
    ENTRINGER, RC
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1980, 32 (06): : 1325 - 1332
  • [35] CERTAIN N-CONNECTED MATROIDS
    WONG, PK
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1978, 299 : 1 - 6
  • [36] MINIMALLY N-CONNECTED DIAGRAPHS
    MADER, W
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (02) : 102 - 117
  • [37] ON CYCLES THROUGH PRESCRIBED VERTICES IN WEAKLY SEPARABLE GRAPHS
    KELMANS, AK
    LOMONOSOV, MV
    DISCRETE MATHEMATICS, 1983, 46 (02) : 183 - 189
  • [38] A characterization of n-connected splitting matroids
    Malavadkar, P. P.
    Shikare, M. M.
    Dhotre, S. B.
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2014, 7 (04)
  • [39] Packing directed cycles through a specified vertex set
    Kawarabayashi, K.
    Kral, D.
    Krcal, M.
    Kreutzer, S.
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 365 - 377
  • [40] SUBHARMONIC FUNCTIONS IN N-CONNECTED DOMAINS
    WOJCICKA, E
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1990, 153 (01) : 1 - 10
12345