Greedy F-colorings of graphs
- 作者Gary Chartrand; Ladislav Nebeský; Ping Zhang
- 卷第272卷
- 期第1期
- 印刷ISSN0012-365X
- 文件大小205.31KB
- 发表时间2003
- DOI10.1016/s0012-365x(03)00182-1
- 页码37-46
同作者推荐
Measuring domination in directed networksRené van den Brink; Robert P. Gilles · 2000
The outflow ranking method for weighted directed graphsRené van den Brink; Robert P. Gilles · 2009
Axiomatizations of the Conjunctive Permission Value for Games with Permission StructuresRené van den Brink; Robert P. Gilles · 1996