Menger's theorem for infinite graphs with ends
- 作者Henning Bruhn; Reinhard Diestel; Maya Stein
- 卷第50卷
- 期第3期
- 印刷ISSN0364-9024
- 电子ISSN1097-0118
- 文件大小127.42KB
- 发表时间2005
- DOI10.1002/jgt.20108
- 页码199-211
同作者推荐
Circular chromatic number of subgraphsHossein Hajiabolhassan; Xuding Zhu · 2003
Circular chromatic number and Mycielski constructionHossein Hajiabolhassan; Xuding Zhu · 2003
Circular perfect graphsXuding Zhu · 2005
Circular choosability via combinatorial NullstellensatzSerguei Norine; Tsai-Lien Wong; Xuding Zhu · 2008
Game coloring the Cartesian product of graphsXuding Zhu · 2008
Total weight choosability of graphsTsai-Lien Wong; Xuding Zhu · 2011
Antimagic labelling of vertex weighted graphsTsai-Lien Wong; Xuding Zhu · 2012