A Note on Spanning Eulerian Graphs

被引：0
|
作者：
Li, Liangchen [1 ]
Li, Xiangwen [1 ]
机构：
[1] Huazhong Normal Univ, Dept Math, Wuhan 430079, Peoples R China
来源：
ARS COMBINATORIA | 2011年 / 101卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is called biclaw-free if it has no biclaw as an introduced subgraph. Lai and Yao [Discrete Math., 307 (2007) 1217] conjectured that every 2-connected biclaw-free graph G with delta(G) >= 4 has a spanning eulerian subgraph H with maximum degree Delta(H) <= 4. In this note, the conjecture is answered to the negative.
引用
收藏
页码：129 / 135
页数：7
相关论文
共 50 条
  • [21] ON FINDING SPANNING EULERIAN SUBGRAPHS
    RICHEY, MB
    PARKER, RG
    RARDIN, RL
    NAVAL RESEARCH LOGISTICS, 1985, 32 (03) : 443 - 455
  • [22] Spanning subgraph with Eulerian components
    Niu, Zhaohong
    Lai, Hong-Jian
    Xiong, Liming
    DISCRETE MATHEMATICS, 2012, 312 (05) : 1013 - 1018
  • [23] Spanning trees and spanning Eulerian subgraphs with small degrees
    Hasanvand, Morteza
    DISCRETE MATHEMATICS, 2015, 338 (08) : 1317 - 1321
  • [24] SPANNING EULERIAN SUBGRAPHS AND MATCHINGS
    CATLIN, PA
    DISCRETE MATHEMATICS, 1989, 76 (02) : 95 - 116
  • [25] Spanning eulerian subgraphs in N2-locally connected claw-free graphs
    Lai, Hong-Jian
    Li, Mingchu
    Shao, Yehong
    Xiong, Liming
    ARS COMBINATORIA, 2010, 94 : 191 - 199
  • [26] Note on the spanning-tree packing number of lexicographic product graphs
    Li, Hengzhe
    Li, Xueliang
    Mao, Yaping
    Yue, Jun
    DISCRETE MATHEMATICS, 2015, 338 (05) : 669 - 673
  • [27] Spanning Eulerian Subgraphs in Generalized Prisms
    Li, Xiaomin
    Li, Dengxin
    Lai, Hong-jian
    ARS COMBINATORIA, 2012, 106 : 305 - 312
  • [28] Spanning eulerian subdigraphs in semicomplete digraphs
    Bang-Jensen, Jorgen
    Havet, Frederic
    Yeo, Anders
    JOURNAL OF GRAPH THEORY, 2023, 102 (03) : 578 - 606
  • [29] Spanning Eulerian Subgraphs of Large Size
    Haghparast, Nastaran
    Kiani, Dariush
    GRAPHS AND COMBINATORICS, 2019, 35 (01) : 201 - 206
  • [30] Spanning Eulerian Subgraphs of Large Size
    Nastaran Haghparast
    Dariush Kiani
    Graphs and Combinatorics, 2019, 35 : 201 - 206
12345