共 50 条
A Note on Spanning Eulerian Graphs
被引:0
|作者:
Li, Liangchen
[1
]
Li, Xiangwen
[1
]
机构:
[1] Huazhong Normal Univ, Dept Math, Wuhan 430079, Peoples R China
来源:
关键词:
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
相关论文