Subject
Computer Science Applications,Information Systems,Signal Processing
Reference13 articles.
1. E. Arjomandi,“An ejGficient algorithm for colouring the edges of a graph with Δ +Colours,” Dept. of Computer Science, York University, Tech. Rep. 1, 1980.
2. S.A.Cook, The complexity of theorem-proving procedures,” Proc. Third Ann. ACM Symp. on the Theory of Computing, 1970, 151–158.
3. D. de Werra, “On some combinatorial problems arising in Scheduling,” INFOR, vol. 8, 1970, 165–175.
4. P. Erdos and R.J. Wilson, “On the chromatic index of almost all graphs,” J. Comb. Theory, Series B, 1977, no. 23, 255–257.
5. H.N. Gabow, “Using Euler partitions to edge colour bipartite multigraphs,” Int. J. Comput. Infor. Sci., vol. 5, no. 4, 1976, 345–355.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Towards the locality of Vizing’s theorem;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23