Fourier analysis and large independent sets in powers of complete graphs
- 作者Mahya Ghandehari; Hamed Hatami
- 卷第98卷
- 期第1期
- 印刷ISSN0095-8956
- 电子ISSN1096-0902
- 文件大小126.85KB
- 发表时间2008
- DOI10.1016/j.jctb.2007.06.003
- 页码164-172
同作者推荐
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