Funder
Hungarian Scientific Research Fund
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference32 articles.
1. The strong chromatic index of a cubic graph is at most 10;Andersen;Discrete Mathematics,1992
2. Winning Ways for your Mathematical Plays;Berlekamp,1982
3. Graphs and interconnection networks: diameter and vulnerability;Bermond,1983
4. Precoloring extension. I. Interval graphs;Biró;Discrete Mathematics,1992
5. On the complexity of some coloring games;Bodlaender;International Journal of Foundations of Computer Science,1991
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献