Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference8 articles.
1. Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult;Broersma;Algorithmica,2006
2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1990
3. Subcolorings and the subchromatic number of a graph;Gimbel;Discrete Math.,2003
4. Partitions of graphs into cographs;Gimbel;Discrete Math.,2010
5. The dichromatic number of a digraph;Neumann Lara;J. Combin. Theory Ser. B,1982
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献