Author:
Janczewski Robert,Turowski Krzysztof
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference11 articles.
1. Broersma HJ (2003) A general framework for coloring problems: old results, new results, and open problems. In: Combinatorial geometry and graph theory. Springer, Berlin, p 65–79
2. Calamoneri T (2006) The $$L(h, k)$$ L ( h , k ) -labelling problem: a survey and annotated bibliography. Comput J 49:585–608
3. Chang GJ, Juan S-T, Hu S-J (1999) $$T$$ T -colorings and $$T$$ T -edge spans of graphs. Graphs Combin 15:295–301
4. Lectures notes in computer science;J Fiala,2001
5. Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance two. SIAM J Discret Math 5:586–595
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献