On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three
暂无分享,去创建一个
[1] Michael O. Albertson,et al. Parsimonious edge coloring , 1996, Discret. Math..
[2] Jean-Luc Fouquet. Graphes Cubiques D'Indice Chromatique Quatre , 1980 .
[3] Romeo Rizzi. Approximating the maximum 3-edge-colorable subgraph problem , 2009, Discret. Math..
[4] Jean-Marie Vanherpe,et al. Tools for parsimonious edge-colouring of graphs with maximum degree three , 2012, ArXiv.
[5] Charles Payan. Sur quelques problèmes de couverture et de couplage en combinatoire , 1977 .
[6] D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .
[7] Eckhard Steffen. Measurements of edge-uncolorability , 2004, Discret. Math..
[8] S. C. Locke,et al. Largest bipartite subgraphs in triangle-free graphs with maximum degree three , 1986 .
[9] Eckhard Steffen,et al. Classifications and characterizations of snarks , 1998, Discret. Math..
[10] R. Isaacs. Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable , 1975 .
[11] Jean-Marie Vanherpe,et al. A new bound for parsimonious edge-colouring of graphs with maximum degree three , 2011, ArXiv.
[12] S. C. Locke. Maximum k-colorable subgraphs , 1982, J. Graph Theory.
[13] Martin Kochol,et al. Five Cycle Double Covers of Some Cubic Graphs , 1995, J. Comb. Theory, Ser. B.