Funder
National Science Foundation
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference49 articles.
1. Models and solution techniques for frequency assignment problems;Aardal;4OR,2003
2. Conflict-free coloring of graphs;Abel;SIAM J. Discrete Math.,2018
3. The strong chromatic index of a cubic graph is at most 10;Andersen;Discrete Math.,1992
4. Colouring graphs with sparse neighbourhoods: bounds and applications;Bonamy;J. Comb. Theory, Ser. B,2022
5. Separating layered treewidth and row treewidth;Bose;Discrete Math. Theor. Comput. Sci.,2022
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献