Independent domination in subcubic bipartite graphs of girth at least six

被引:0
|
作者
Henning, Michael A. [1 ]
Löwenstein, Christian [2 ]
Rautenbach, Dieter [2 ]
机构
[1] Department of Mathematics, University of Johannesburg, Auckland-Park,2006, South Africa
[2] Institute of Optimization and Operations Research, Ulm University, Ulm,89081, Germany
关键词
Graph theory;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:399 / 403
相关论文
共 50 条
  • [11] A note on independent domination in graphs of girth 6
    Haviland, Julie
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 42 : 171 - 175
  • [12] A note on independent domination in graphs of girth 5
    Haviland, Julie
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 40 : 301 - 304
  • [13] Maximum Bisections of Graphs with Girth at Least Six
    Wu, Shufei
    Xiong, Xiaobei
    GRAPHS AND COMBINATORICS, 2024, 40 (06)
  • [14] Flexibility of planar graphs of girth at least six
    Dvorak, Zdenek
    Masarik, Tomas
    Musilek, Jan
    Pangrac, Ondrej
    JOURNAL OF GRAPH THEORY, 2020, 95 (03) : 457 - 466
  • [15] Exponential Domination in Subcubic Graphs
    Bessy, Stephane
    Ochem, Pascal
    Rautenbach, Dieter
    ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (04):
  • [16] Size of the largest induced forest in subcubic graphs of girth at least four and five
    Kelly, Tom
    Liu, Chun-Hung
    JOURNAL OF GRAPH THEORY, 2018, 89 (04) : 457 - 478
  • [17] Broadcast Domination in Subcubic Graphs
    Yang, Wei
    Wu, Baoyindureng
    GRAPHS AND COMBINATORICS, 2022, 38 (06)
  • [18] Broadcast Domination in Subcubic Graphs
    Wei Yang
    Baoyindureng Wu
    Graphs and Combinatorics, 2022, 38
  • [19] Domination in Graphs of Minimum Degree at least Two and Large Girth
    Christian Löwenstein
    Dieter Rautenbach
    Graphs and Combinatorics, 2008, 24 : 37 - 46
  • [20] Domination in graphs of minimum degree at least two and large girth
    Loewenstein, Christian
    Rautenbach, Dieter
    GRAPHS AND COMBINATORICS, 2008, 24 (01) : 37 - 46