Drawings of Cm×Cn with One Disjoint Family
- 作者Gelasio Salazar
- 卷第76卷
- 期第2期
- 印刷ISSN0095-8956
- 电子ISSN1096-0902
- 文件大小102.17KB
- 发表时间1999
- DOI10.1006/jctb.1998.1890
- 页码129-135
同标题推荐
同作者推荐
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 of 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