Abstract
AbstractA class of graphs is called monotone if it is closed under deletion of vertices and edges. Any such class may be defined in terms of forbidden subgraphs. The chromatic index of a graph is the smallest number of colors required for its edge-coloring such that any two adjacent edges have different colors. We obtain a complete classification of the complexity of the chromatic index problem for all monotone classes defined in terms of forbidden subgraphs having at most 6 edges or at most 7 vertices.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference26 articles.
1. “Updating the complexity status of coloring graphs without a fixed induced linear forest”;Theor. comput. sci,2012
2. “Edge dominating set and colorings on graphs with fixed clique-width”;Discrete Appl. Math,2003
3. “Edge dominating set and colorings on graphs with fixed clique-width”;Discrete Appl. Math,2003
4. “The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices”;Sib. elektr. matem. izv,2014
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献