论文信息 - A new bound for parsimonious edge-colouring of graphs with maximum degree three - 字舞流文

A new bound for parsimonious edge-colouring of graphs with maximum degree three

In a graph G of maximum degree 3, let (G) denote the largest fraction of edges that can be 3 edge-coloured. Rizzi [9] showed that (G) � 1 − 2

Jean-Marie Vanherpe | Jean-Luc Fouquet

[1] Eckhard Steffen. Measurements of edge-uncolorability , 2004, Discret. Math..

[2] S. C. Locke,et al. Largest bipartite subgraphs in triangle-free graphs with maximum degree three , 1986 .

[3] Jean-Luc Fouquet. Graphes Cubiques D'Indice Chromatique Quatre , 1980 .

[4] Romeo Rizzi. Approximating the maximum 3-edge-colorable subgraph problem , 2009, Discret. Math..

[5] D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[6] Jean-Marie Vanherpe,et al. On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three , 2013, Graphs Comb..

[7] Jean-Marie Vanherpe,et al. Tools for parsimonious edge-colouring of graphs with maximum degree three , 2012, ArXiv.