3-edge-coloring of cubic graphs |
Published date:2014-11-15 Provided by:School of Science |
Title: 3-edge-coloring of cubic graphs
Guest Speaker: Prof. Cun-Quan Zhang (West Virginia University) Time: 2014-11-14 (Friday), 15:30 - 17:00 Location: SY103 Content & Introduction:
A graph is cubic if the degree of every vertex is 3. A 3-edge-coloring of a cubic graph G is a mapping c : E(G) —〉{1,2,3 } such that no vertex is incident with edges in same color. It is well-known that the map 4-color problem is equivalent to the 3-edge-coloring of planar cubic bridgeless graphs. This is an introductional lecture, in which, some fundamental results, techniques about the 3-edge-coloring of cubic graphs will be introduced and surveyed. |