Author:
de Werra Dominique,Demange Mare,Escoffier Bruno,Monnot Jerome,Paschos Vangelis Th.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Berge, C.: Graphs and hypergraphs. North Holland, Amsterdam (1973)
2. Bodlaender, H.L., Jansen, K., Woeginger, G.J.: Scheduling with incompatible jobs. Discrete Appl. Math. 55, 219–232 (1990)
3. Chung, F.R.K., Gyárfás, A., Tuza, Z., Trotter, W.T.: The maximum number of edges in 2K2-free graphs of bounded degree. Discrete Mathematics 81, 129–135 (1990)
4. Lecture Notes in Computer Science;M. Demange,2002
5. Garey, M.R., Johnson, D.S.: Computers and intractability. a guide to the theory of NP-completeness. Freeman, New York (1979)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Hajós-like theorem for weighted coloring;Journal of the Brazilian Computer Society;2013-01-11
2. On the max-weight edge coloring problem;Journal of Combinatorial Optimization;2009-03-14
3. (ℓ, k)-ROUTING ON PLANE GRIDS;Journal of Interconnection Networks;2009-03
4. On the Maximum Edge Coloring Problem;Approximation and Online Algorithms;2009
5. Polynomial approximation: a structural and operational study;4OR;2006-10-19