CYCLES IN BIPARTITE DIGRAPHS WITH GIVEN NUMBER OF ARCS

被引：0
|
作者：
MANOUSSAKIS, M
MANOUSSAKIS, Y
机构：
来源：
COMBINATORICS / | 1988年 / 52卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：393 / 404
页数：12
相关论文
共 50 条
  • [21] The Aα spectral moments of digraphs with a given dichromatic number
    Yang, Xiuwen
    Broersma, Hajo
    Wang, Ligong
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2024, 685 : 77 - 103
  • [22] On the spectral radius of simple digraphs with prescribed number of arcs
    Jin, Ya-Lei
    Zhang, Xiao-Dong
    DISCRETE MATHEMATICS, 2015, 338 (09) : 1555 - 1564
  • [23] Spectral radius of digraphs with given dichromatic number
    Lin, Huiqiu
    Shu, Jinlong
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2011, 434 (12) : 2462 - 2467
  • [24] Sizes and transmissions of digraphs with a given clique number
    Huang, Zejun
    Lin, Huiqiu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1642 - 1649
  • [25] Sizes and transmissions of digraphs with a given clique number
    Zejun Huang
    Huiqiu Lin
    Journal of Combinatorial Optimization, 2016, 31 : 1642 - 1649
  • [26] A Sufficient Condition for Pre-Hamiltonian Cycles in Bipartite Digraphs
    Darbinyan, Samvel
    Karapetyan, Iskandar
    2017 ELEVENTH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGIES (CSIT), 2017, : 101 - 109
  • [27] Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs
    You, Lihua
    Wu, Yuhan
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2011, 434 (05) : 1215 - 1227
  • [28] Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
    Chiba, Shuya
    Yoshida, Koshin
    DISCRETE MATHEMATICS, 2025, 348 (02)
  • [29] COUNTING THE NUMBER OF HAMILTON CYCLES IN RANDOM DIGRAPHS
    FRIEZE, A
    SUEN, S
    RANDOM STRUCTURES & ALGORITHMS, 1992, 3 (03) : 235 - 241
  • [30] Finding minimal branchings with a given number of arcs
    Cvetković, Dragoš
    Čangalović, Mirjana
    Yugoslav Journal of Operations Research, 2002, 12 (01) : 1 - 10
12345