Author:
Cranston Daniel W.,Kim Seog-Jin,Yu Gexin
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. Borodin, O.V.: On the total coloring of planar graphs. J. Reine Angew. Math. 394, 180–185 (1989)
2. Borodin, O.V.: An extension of Kotzig’s theorem and the list edge colouring of planar graphs. Mat. Zametki 48, 22–28 (1990) (in Russian)
3. Borodin, O.V., Kostochka, A.V., Woodall, D.R.: List edge and list total colourings of multigraphs. J. Comb. Theory B 71, 184–204 (1997)
4. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(1), 51–229 (2006). http://annals.princeton.edu/annals/2006/164-1/p02.xhtml
5. Cornuéjols, G.: The strong perfect graph theorem. Optima 70, 2–6 (2003). http://integer.tepper.cmu.edu/webpub/optima.pdf
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献