On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
暂无分享,去创建一个
Vahan V. Mkrtchyan | Samvel S. Petrosyan | Gagik N. Vardanyan | Davit Aslanyan | V. Mkrtchyan | Gagik N. Vardanyan | S. S. Petrosyan | G. Vardanyan | Davit Aslanyan | Davit Aslanyan
[1] Michael O. Albertson,et al. Parsimonious edge coloring , 1996, Discret. Math..
[2] Romeo Rizzi. Approximating the maximum 3-edge-colorable subgraph problem , 2009, Discret. Math..
[3] Eckhard Steffen. Measurements of edge-uncolorability , 2004, Discret. Math..
[4] Vahan V. Mkrtchyan. A note on minimal matching covered graphs , 2006, Discret. Math..
[5] Vahan V. Mkrtchyan,et al. On disjoint matchings in cubic graphs , 2008, Discret. Math..
[6] Vahan V. Mkrtchyan. On trees with a maximum proper partial 0-1 coloring containing a maximum matching , 2006, Discret. Math..
[7] Vahan V. Mkrtchyan,et al. On Edge-Disjoint Pairs Of Matchings , 2008, Discret. Math..
[8] Frank Harary,et al. On the Core of a Graph , 1967 .
[9] D. West. Introduction to Graph Theory , 1995 .
[10] Eckhard Steffen,et al. Classifications and characterizations of snarks , 1998, Discret. Math..
[11] Michael O. Albertson,et al. The edge chromatic difference sequence of a cubic graph , 1997, Discret. Math..
[12] Anush Tserunyan,et al. Characterization of a class of graphs related to pairs of disjoint matchings , 2007, Discret. Math..