On 3-regular digraphs without vertex disjoint cycles of different lengths

被引：11

作者：

Ngo Dac Tan ^{[1
]}

机构：

[1] Vietnam Acad Sci & Technol, Inst Math, 18 Hoang Quoc Viet Rd, Hanoi 10307, Vietnam

来源：

DISCRETE MATHEMATICS | 2017年 / 340卷 / 08期

关键词：

3-regular digraph; Vertex disjoint cycles; Cycles of different lengths; Girth;

D O I：

10.1016/j.disc.2017.03.024

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We raise the conjecture that for every integer g >= 3 there are only finitely many 3-regular digraphs of girth g without vertex disjoint directed cycles of different lengths and give support for this conjecture by proving that it is true for g = 3. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：1933 / 1943

页数：11

共 4 条

[1] Graphs and digraphs with all 2-factors isomorphic [J].

Abreu, M ;

Aldred, REL ;

Funk, M ;

Jackson, B ;

Labbate, D ;

Sheehan, J .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 92 (02) :395-404

[2]

[Anonymous], 2001, Digraphs: theory, algorithms and applications

[3] VERTEX DISJOINT CYCLES OF DIFFERENT LENGTH IN DIGRAPHS [J].

Henning, Michael A. ;

Yeo, Anders .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (02) :687-694

[4] On vertex disjoint cycles of different lengths in 3-regular digraphs [J].

Ngo Dac Tan .

DISCRETE MATHEMATICS, 2015, 338 (12) :2485-2491

← 1 →