Spanning Even Subgraphs of 3-Edge-Connected Graphs

被引：12

作者：

Jackson, Bill ^{[1
]}

Yoshimoto, Kiyoshi ^{[2
]}

机构：

[1] Queen Mary Univ London, Sch Math Sci, London E1 4NS, England

[2] Nihon Univ, Coll Sci & Technol, Dept Math, Tokyo 1018308, Japan

来源：

JOURNAL OF GRAPH THEORY | 2009年 / 62卷 / 01期

关键词：

longest cycle; dominating cycle; edge degree; remote edges; triangle free graph; bipartite graph; LINE GRAPHS; FLOWS;

D O I：

10.1002/jgt.20386

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

By Petersen's theorem, a bridgeless cubic graph has a 2-factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3-edge-connectivity, we can find a spanning even subgraph in which every component has at least five vertices. We show that this is in some sense best possible by constructing an infinite family of 3-edge-connected graphs in which every spanning even subgraph has 5-cycle as a component. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 62: 37-47, 2009

引用

页码：37 / 47

页数：11

共 50 条

[1] A note on enumeration of 3-edge-connected spanning subgraphs in plane graphs
Matsui, Yasuko
Ozeki, Kenta
[J]. IEICE Transactions on Information and Systems, 2021, E104D (03) : 389 - 391
[2] A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs
Matsui, Yasuko
Ozeki, Kenta
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2021, E104D (03): : 389 - 391
[3] Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs
Chen, ZH
Lai, HJ
Li, XW
Li, DY
Mao, JZ
[J]. JOURNAL OF GRAPH THEORY, 2003, 42 (04) : 308 - 319
[4] Spanning trails that join given edges in 3-edge-connected graphs
Lai, HJ
Zhang, XK
[J]. ARS COMBINATORIA, 2000, 57 : 301 - 318
[5] On 3-Edge-Connected Supereulerian Graphs
Lai, Hong-Jian
Li, Hao
Shao, Yehong
Zhan, Mingquan
[J]. GRAPHS AND COMBINATORICS, 2011, 27 (02) : 207 - 214
[6] Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
Bilinski, Mark
Jackson, Bill
Ma, Jie
Yu, Xingxing
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2011, 101 (04) : 214 - 236
[7] On 3-Edge-Connected Supereulerian Graphs
Hong-Jian Lai
Hao Li
Yehong Shao
Mingquan Zhan
[J]. Graphs and Combinatorics, 2011, 27 : 207 - 214
[8] A Note on the 3-Edge-Connected Supereulerian Graphs
Xiao Min LIDeng Xin LI School of Mathematics and StatisticsChongqing Technology and Business UniversityChongqing PRChina
[J]. 数学研究与评论., 2010, 30 (05) - 946
[9] Connectivity of orientations of 3-edge-connected graphs
Horsch, Florian
Szigeti, Zoltan
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 2021, 94
[10] Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs
Xiangwen Li
Chunxiang Wang
Qiong Fan
Zhaohong Niu
Liming Xiong
[J]. Graphs and Combinatorics, 2013, 29 : 275 - 280

← 1 2 3 4 5 →