Maximum Δ-edge-colorable subgraphs of class II graphs
暂无分享,去创建一个
[1] Vahan V. Mkrtchyan,et al. On disjoint matchings in cubic graphs , 2008, Discret. Math..
[2] Eckhard Steffen,et al. Classifications and characterizations of snarks , 1998, Discret. Math..
[3] Vahan V. Mkrtchyan,et al. On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs , 2009, Discret. Appl. Math..
[4] Michael O. Albertson,et al. Parsimonious edge coloring , 1996, Discret. Math..
[5] Romeo Rizzi. Approximating the maximum 3-edge-colorable subgraph problem , 2009, Discret. Math..
[6] Tommy R. Jensen,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[7] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[8] Eckhard Steffen. Measurements of edge-uncolorability , 2004, Discret. Math..
[9] Eckhard Steffen. A refinement of Vizing's theorem , 2000, Discret. Math..
[10] Hal A. Kierstead,et al. On the chromatic index of multigraphs without large triangles , 1984, J. Comb. Theory, Ser. B.