A CHARACTERIZATION OF 4-EDGE-CONNECTED EULERIAN GRAPHS

被引：0
|
作者：
WEIDL, P
机构：
[1] Faculty of Mathematics, University of Bielefeld, Bielefeld
来源：
JOURNAL OF GRAPH THEORY | 1995年 / 20卷 / 01期
关键词：
D O I：
10.1002/jgt.3190200111
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let upsilon be an arbitrary vertex of a 4-edge-connected Eulerian graph G. First we show the existence of a nonseparating cycle decomposition of G with respect to upsilon. With the help of this decomposition we are then able to construct 4 edge-independent spanning trees with the common root upsilon in the same graph. We conclude that an Eulerian graph G is 4-edge-connected iff for every vertex r is an element of V(G) there exist 4 edge-independent spanning trees with a common root r. (C) 1995 John Wiley and Sons, Inc.
引用
收藏
页码：101 / 112
页数：12
相关论文
共 50 条
  • [1] The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    [J]. PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 345 - +
  • [2] The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
    Ken-ichi Kawarabayashi
    Yusuke Kobayashi
    [J]. Combinatorica, 2015, 35 : 477 - 495
  • [3] The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    [J]. COMBINATORICA, 2015, 35 (04) : 477 - 495
  • [4] Spanning trails in essentially 4-edge-connected graphs
    Xu, Jinquan
    Chen, Zhi-Hong
    Lai, Hong-Jian
    Zhang, Meng
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 162 : 306 - 313
  • [5] PACKING EDGE-DISJOINT ODD EULERIAN SUBGRAPHS THROUGH PRESCRIBED VERTICES IN 4-EDGE-CONNECTED GRAPHS
    Kakimura, Naonori
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (02) : 766 - 782
  • [6] Edge-disjoint odd cycles in 4-edge-connected graphs
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 12 - 27
  • [7] Packing and covering immersions in 4-edge-connected graphs
    Liu, Chun-Hung
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2021, 151 : 148 - 222
  • [8] REMOVABLE EDGES IN CYCLICALLY 4-EDGE-CONNECTED CUBIC GRAPHS
    ANDERSEN, LD
    FLEISCHNER, H
    JACKSON, B
    [J]. GRAPHS AND COMBINATORICS, 1988, 4 (01) : 1 - 21
  • [9] Edge-disjoint Odd Cycles in 4-edge-connected Graphs
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    [J]. 29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 206 - 217
  • [10] Shortness coefficient of cyclically 4-edge-connected cubic graphs
    Lo, On-Hei S.
    Schmidt, Jens M.
    Van Cleemput, Nicolas
    Zamfirescu, Carol T.
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (01):
12345