Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference5 articles.
1. Bar-Noy, A., Motwani, R., Naor, J.: The greedy algorithm is optimal for on-line edge coloring. Inf. Process. Lett. 44, 251–253 (1992)
2. Favrholdt, L.M., Nielsen, M.N.: On-line edge-coloring with a fixed number of colors. Algorithmica 35, 176–191 (2003)
3. Horák, P., Rosa, A.: Maximal partial Latin squares. In: Rees, R. (ed) Graphs, matrices and designs. pp. 225–233. Kluwer, Dordrecht (1993)
4. Rosa, A.: Maximal partial designs and configurations. Le Mat. 45, 149–162 (1990)
5. Rosa, A.: Maximal designs and configurations—a survey. Acta Univ. M. Belii Ser. Math. 23, 9–25 (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximal edge colorings of graphs;European Journal of Combinatorics;2024-03